TY - GEN A1 - Schwan, Christian A1 - Strehler, Martin T1 - Energy-efficient Routing of Hybrid Vehicles T2 - arXiv.org N2 - We consider a constrained shortest path problem with two resources. These two resources can be converted into each other in a particular manner. Our practical application is the energy optimal routing of hybrid vehicles. Due to the possibility of converting fuel into electric energy this setting adds new characteristics and new combinatorial possibilities to the common constrained shortest path problem (CSP). We formulate the resulting problem as a generalization of CSP. We show that optimal paths in this model may contain cycles and we state conditions to prevent them. The main contribution is a polynomial-time approximation scheme and a simpler approximation algorithm for computing energy-optimal paths in graphs. KW - Discrete Mathematics Y1 - 2016 UR - http://arxiv.org/abs/1601.02371 ER - TY - CHAP A1 - Scheffler, Robert A1 - Strehler, Martin ED - Goerigk, Marc ED - Werneck, Renato T1 - Optimizing Traffic Signal Timings for Mega Events T2 - 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), ATMOS’16, August 25, 2016, Aarhus, Denmark Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-66724 UR - http://drops.dagstuhl.de/opus/volltexte/2016/6532 SN - 978-3-95977-021-7 SP - 8,1 EP - 8,16 PB - Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik CY - Dagstuhl, Germany ER - TY - CHAP A1 - Schade, Stanley A1 - Strehler, Martin ED - Goerigk, Marc ED - Werneck, Renato T1 - The Maximum Flow Problem for Oriented Flows T2 - 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016) N2 - In several applications of network flows, additional constraints have to be considered. In this paper, we study flows, where the flow particles have an orientation. For example, cargo containers with doors only on one side and train coaches with 1st and 2nd class compartments have such an orientation. If the end position has a mandatory orientation, not every path from source to sink is feasible for routing or additional transposition maneuvers have to be made. As a result, a source-sink path may visit a certain vertex several times. We describe structural properties of optimal solutions, determine the computational complexity, and present an approach for approximating such flows. KW - network flow with orientation, graph expansion, approximation, container logistics, train routing Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-65318 UR - http://drops.dagstuhl.de/opus/volltexte/2016/6531 SN - 978-3-95977-021-7 SP - 1 EP - 13 PB - Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik CY - Dagstuhl, Germany ER - TY - GEN A1 - Strehler, Martin A1 - Merting, Sören A1 - Schwan, Christian T1 - Energy-efficient shortest routes for electric and hybrid vehicles T2 - Transportation Research Part B: Methodological Y1 - 2017 U6 - https://doi.org/10.1016/j.trb.2017.03.007 SN - 0191-2615 VL - Vol. 103 SP - 111 EP - 135 ER - TY - CHAP A1 - Strehler, Martin A1 - Scheffler, Robert ED - D'Angelo, Gianlorenzo ED - Dollevoet, Twan T1 - Optimizing Traffic Signal Settings for Public Transport Priority T2 - 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), September 7–8, 2017, Vienna, Austria KW - transit signal priority KW - traffic flow KW - traffic signal optimization KW - cyclically time-expanded network KW - public transport Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-79109 UR - http://www.dagstuhl.de/dagpub/978-3-95977-042-2 SN - 978-3-95977-042-2 SP - 9-1 EP - 9-15 PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH CY - Wadern ER - TY - CHAP A1 - Schwan, Christian A1 - Strehler, Martin ED - Bock, Hans Georg ED - Phu, Hoang Xuan ED - Rannacher, Rolf ED - Schlöder, Johannes T1 - Two FPTAS for the Constrained Shortest Path Problem Applied to Hybrid Vehicle Routing T2 - Proceedings of the Sixth International Conference on High Performance Scientific Computing, March 16-20, 2015, Hanoi, Vietnam Y1 - 2017 SN - 978-3-319-67167-3 U6 - https://doi.org/10.1007/978-3-319-67168-0 SP - 223 EP - 234 PB - Springer International Publishing ET - 1. Auflage ER - TY - CHAP A1 - Scheffler, Robert A1 - Strehler, Martin A1 - Vargas Koch, Laura ED - Christodoulou, George ED - Harks, Tobias T1 - Equilibria in Routing Games with Edge Priorities T2 - 14th International Conference, WINE 2018, Oxford, UK, December 15–17, 2018, Proceedings Y1 - 2018 SN - 978-3-030-04612-5 U6 - https://doi.org/10.1007/978-3-030-04612-5_27 SP - 408 EP - 422 PB - Springer International Publishing CY - Cham ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Recognizing Graph Search Trees T2 - arXiv.org Y1 - 2018 UR - https://arxiv.org/abs/1811.09249v2 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - On the End-Vertex Problem of Graph Searches T2 - Discrete Mathematics & Theoretical Computer Science Y1 - 2019 SN - 1365-8050 SN - 1462-7264 VL - 21 IS - 1 ER - TY - GEN A1 - Thunig, Theresa A1 - Scheffler, Robert A1 - Strehler, Martin A1 - Nagel, Kai T1 - Optimization and simulation of fixed-time traffic signal control in real-world applications T2 - 8th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications ABMTRANS'19 Y1 - 2019 U6 - https://doi.org/10.1016/j.procs.2019.04.113 SN - 1877-0509 SP - 826 EP - 833 PB - Elsevier CY - Amsterdam ER -