Routing of electric vehicles: Constrained shortest path problems with resource recovering nodes

OpenAccess Series in Informatics

Volumn 48, Issue , 2015, Pages 29-41

  Merting, Sören ^a   Schwan, Christian ^b   Strehler, Martin ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Constrained network flow; Constrained shortest paths; FPTAS; Routing of electric vehicles

Indexed keywords

APPROXIMATION ALGORITHMS; ELECTRIC VEHICLES; SECONDARY BATTERIES; STRUCTURAL OPTIMIZATION; TRAVEL TIME;

ARBITRARY NUMBER; BATTERY CAPACITY; CHARGING FUNCTIONS; CONSTRAINED SHORTEST PATH; FPTAS; NETWORK FLOW PROBLEMS; NETWORK FLOWS; OPTIMAL SOLUTIONS;

GRAPH THEORY;

EID: 84946051482     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2015.29     Document Type: Conference Paper

References (23)

1. Georg Baier. Flows with Path Restrictions. PhD thesis, TU Berlin, 2003.
2. Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, and Martin Skutella. Length-bounded cuts and flows. In Automata, Languages and Programming, LNCS 4051, pages 679-690. Springer Berlin Heidelberg, 2006.
3. Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, and Dorothea Wagner. Speed-consumption tradeoff for electric vehicle route planning. In Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'14) , OpenAccess Series in Informatics (OASIcs), pages 138-151, 2014.
4. Moritz Baum, Julian Dibbelt, Thomas Pajor, and DorotheaWagner. Energy-optimal routes for electric vehicles. In Proceedings of the 21st A CM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 54-63. ACM Press, 2013.
5. John E. Beasley and Nicos Christofides. An algorithm for the resource constrained shortest path problem. Networks, 19(4):379-394, 1989.
6. Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F.Werneck. Customizable route planning. In P. M. Pardalos and S. Rebenn ack, editors, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), LNCS 6630, pages 376-387. Springer, 2011.
7. Geoffrey Exoo. On line disjoint paths of bounded length. Discrete Mathematics, 44(3):317-318, 1983.
8. Lisa Fleischer and Martin Skutella. Quickest flows over time. SIAM Journal on Computing, 36(6):1600-1630, 2007.
9. Lisa K. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics, 13(4):505-520, 2000.
10. Michael R. Garey,David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA 1979
11. Naveen Garg and Jochen Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM Journal on Computing, 37(2):630-652, 2007.
12. Gabriel Handler and Israel Zang. A dual algorithm for the constrained shortest path p roblem. Networks, 10(4):293-309, 1980.
13. Refael Hassin. Approximation schemes for the restricted shortest path problem. Math. Oper. Res., 17(1):36-42, February 1992.
14. LászlóLovász, Víctor Neumann-Lara, and Michael Plummer. Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica, 9(4):269-276, 1978.
15. Kurt Mehlhorn and Mark Ziegelmann. Resource constrained shortest paths. In Mike S. Paterson, editor, Algorithms-ESA 2000, LNCS 1879, pages 326-337. Springer Berlin Heidelberg, 2000.
16. Katta G. Murty and Santosh N. Kabadi. Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming, 39(2):117-129, 1987.
17. Ludoví t Niepel and Daniela Safaríková. On a generalization of Menger's theorem. Acta Mathematica Universitatis Comenianae, 42:275-284, 1983.
18. Cynthia A. Phillips. The network inhibition problem. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory o f Computing, STOC'93, pages 776-785, New York, NY, USA, 1993. ACM.
19. Martin Sachenbacher, Martin Leucker, Andreas Artmeier, and Julian Haselmayr. Efficient energy-optimal routing for electric vehicles. In Conference on Artificial Intelligence, Special Track on Computational Sustainability. AAAI, 2011.
20. Sabine Storandt. Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science, pages 20-25. ACM, 2012.
21. Sabine Storandt and Stefan Funke. Enabling e-mobility: Facility location for battery loading stations. In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence. AAAI Press, 2013.
22. Arthur Warburton. Approx imation of pareto optima in multiple-objective, shortest-path problems. Operations Research, 35(1):70, 1987.
23. Mark Ziegelmann. Constrained shortest paths and related problems. Phd thesis, Universität des Saarlandes, Saarbrücken, 2001.