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.
Efficient Profile Routing for Electric Vehicles
Internet of Vehicles – Technologies and Services ; 1 ; 21-30
Lecture Notes in Computer Science ; 8662 , 1
2014-01-01
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
State-based , energy-efficient , time-dependent , flexible routing , profile search , electric vehicles Computer Science , Computer Communication Networks , Information Systems Applications (incl. Internet) , Information Storage and Retrieval , Database Management , Algorithm Analysis and Problem Complexity , Management of Computing and Information Systems
Efficient Profile Routing for Electric Vehicles
British Library Conference Proceedings | 2014
|Electric Vehicles Energy Efficient Routing Using Ant Colony Optimization
SAE Technical Papers | 2017
|Energy Efficient Routing for Electric Vehicles using Particle Swarm Optimization
SAE Technical Papers | 2014
|