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 -