Abstract
This paper introduces a powerful, efficient and generic framework for optimal routing of electric vehicles in the setting of flexible edge cost functions and arbitrary initial states.
More precisely, the introduced state-based routing problem is a consolidated model covering energy-efficiency and time-dependency. Given two vertices and an initial state the routing problem is to find optimal paths yielding minimal final states, while the profile routing problem is to find optimal paths for all initial states. A universal method for applying shortest path techniques to profile routing is developed. To show the genericity and efficiency of this approach it is instantiated for two typical shortest path algorithms, namely for A* and Contraction Hierarchies. Especially using the latter, a highly efficient solution for energy-efficient profile routing is obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks. Tech. rep., Microsoft Research (2014)
Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 97–105 (2009)
Delling, D., Wagner, D.: Time-dependent route planning. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207–230. Springer, Heidelberg (2009)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Eisner, J., Funke, S., Storandt, S.: Optimal route planning for electric vehicles in large networks. In: Twenty-Fifth AAAI Conference on Artificial Intelligence, vol. 25, pp. 1108–1113 (2011)
Geisberger, R., Kobitzsch, M., Sanders, P.: Route planning with flexible objective functions. In: ALENEX, pp. 124–137. SIAM (2010)
Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008)
Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165. Society for Industrial and Applied Mathematics (2005)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)
Masuch, N., Lützenberger, M., Keiser, J.: An Open Extensible Platform for Intermodal Mobility Assistance. Procedia Computer Science 19, 396–403 (2013), http://www.sciencedirect.com/science/article/pii/S1877050913006625 , the 4th International Conference on Ambient Systems, Networks and Technologies (ANT 2013), the 3rd International Conference on Sustainable Energy Information Technology, SEIT 2013
Sachenbacher, M., Leucker, M., Artmeier, A., Haselmayr, J.: Efficient energyoptimal routing for electric vehicles. In: AAAI Publications, Twenty-Fifth AAAI Conference on Artificial Intelligence, vol. 25, pp. 1402–1407 (2011)
Schönfelder, R., Leucker, M.: Stochastisches Routen für Elektrofahrzeuge. Energieinformatik (2011)
Skriver, A., Andersen, K.: A label correcting approach for solving bicriterion shortest-path problems. Computers & Operations Research 27(6), 507–524 (2000), http://www.sciencedirect.com/science/article/pii/S0305054899000374
Uludag, S., Uludag, Z., Nahrstedt, K., Lui, K.S., Baker, F.: A laplace transformbased method to stochastic path finding. In: IEEE International Conference on Communications, ICC 2009, pp. 1–5 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Schönfelder, R., Leucker, M., Walther, S. (2014). Efficient Profile Routing for Electric Vehicles. In: Hsu, R.CH., Wang, S. (eds) Internet of Vehicles – Technologies and Services. IOV 2014. Lecture Notes in Computer Science, vol 8662. Springer, Cham. https://doi.org/10.1007/978-3-319-11167-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-11167-4_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11166-7
Online ISBN: 978-3-319-11167-4
eBook Packages: Computer ScienceComputer Science (R0)