Efficient Profile Routing for Electric Vehicles

René Schönfelder, Martin Leucker, Sebastian Walther


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.

Original languageEnglish
Title of host publicationInternet of Vehicles – Technologies and Services
Number of pages10
VolumeLNCS 8662
Place of PublicationCham
PublisherSpringer Verlag
Publication date01.09.2014
ISBN (Print)978-3-319-11166-7
ISBN (Electronic)978-3-319-11167-4
Publication statusPublished - 01.09.2014
Event1st International Conference on Internet of Vehicles
- Beijing, China
Duration: 01.09.201403.09.2014
Conference number: 106990


Dive into the research topics of 'Efficient Profile Routing for Electric Vehicles'. Together they form a unique fingerprint.

Cite this