Abstract
Route planning applications designed for electric vehicles have to consider a number of additional constraints. With the limited range and comparatively long charging times, it is of utmost importance to consider energy consumption in routing applications. However, recently published algorithmic approaches for electric vehicle routing focus solely on specific aspects of this problem, such as optimizing energy consumption as single criterion. In this work, we present first steps towards a holistic framework for computing shortest paths for electric vehicles with limited range. This includes the possibility of driving instructions, such as driving speed adjustments to save energy, realistic modeling of battery charging procedures, and the integration of turn costs.
Similar content being viewed by others
References
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269–271
Bast H, Delling D, Goldberg AV, Müller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2014) Route planning in transportation networks. Technical Report MSR-TR-2014-4, Microsoft Research
Sachenbacher M, Leucker M, Artmeier A, Haselmayr J (2011) Efficient energy-optimal routing for electric vehicles. In: Proceedings of the 25th AAAI conference on artificial intelligence. AAAI Press, Palo Alto, California
Eisner J, Funke S, Storandt S (2011) Optimal route planning for electric vehicles in large network. In: Proceeding of the 25th AAAI conference on artificial intelligence. AAAI Press, Palo Alto, California
Baum M, Dibbelt J, Pajor T, Wagner D (2013) Energy-optimal routes for electric vehicles. In: Proceeding of the 21st ACM SIGSPATIAL international conference on advances in geographic information systems. ACM Press, New York
Storandt S, Funke S (2012) Cruising with a battery-powered vehicle and not getting stranded. In: Proceeding of the 26th AAAI conference on artificial intelligence. AAAI Press
Baum M, Dibbelt J, Hübschle-Schneider L, Pajor T, Wagner D. Speed-consumption trade-off for electric vehicles. In: Proceeding of the 14th workshop on algorithmic approaches for transportation modeling, optimization, and systems. OASIcs
Storandt S (2012) Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In: Proceeding of the 5th ACM SIGSPATIAL international workshop on computational transportation science. ACM Press, New York
Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of N P-completeness. W. H. Freeman and Company, New York
Hansen P (1979) Bricriteria path problems. In: Multiple criteria decision making—theory and application. Springer, Berlin, Heidelberg
Queiros Martins E (1984) On a multicriteria shortest path problem. Eur J Oper Res 26(3):236–245
Johnson DB (1977) Efficient algorithms for shortest paths in sparse networks. J ACM 24(1):1–13
Robert G, Peter S, Dominik S, Christian V (2012) Exact routing in large road networks using contraction hierarchies. Transp Sci 46(3):388–404
Geisberger R, Vetter C (2001) Effcient routing in road networks with turn costs. In: Proceeding of the 10th international symposium on experimental algorithms. Springer, New York
Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Proceeding of the 10th international symposium on experimental algorithms. Springer, New York
Hausberger S (2003) Simulation of real world vehicle exhaust emissions. Mitteilungen des Institutes für Verbrennungskraftmaschinen und Thermodynamik, vol 82. Technische Universität Graz
Hausberger S, Rexeis M, Zallinger M, Luz R (2009) Emission factors from the model PHEM for the HBEFA version 3. Technical Report I-20/2009, University of Technology, Graz
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by EU Grant 609026 (project MOVESMART) and BMWi Grant 01ME12013 (project iZeus).
Rights and permissions
About this article
Cite this article
Baum, M., Dibbelt, J., Gemsa, A. et al. Towards route planning algorithms for electric vehicles with realistic constraints. Comput Sci Res Dev 31, 105–109 (2016). https://doi.org/10.1007/s00450-014-0287-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00450-014-0287-3