# Efficient Profile Routing for Electric Vehicles

Title | Efficient Profile Routing for Electric Vehicles |

Publication Type | Conference Paper |

Year of Publication | 2014 |

Authors | Schönfelder, R, Leucker, M, Walther, S |

Conference Name | Internet of Vehicles – Technologies and Services |

Publisher | Springer International Publishing |

Conference Location | Beijing, China |

ISBN Number | 978-3-319-11166-7 |

Keywords | electric vehicles, energy-efficient, flexible routing, profile search, State-based, time-dependent |

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. |

URL | http://link.springer.com/chapter/10.1007%2F978-3-319-11167-4_3 |

DOI | 10.1007/978-3-319-11167-4_3 |

Bibtex:

@inproceedings {1148, title = {Efficient Profile Routing for Electric Vehicles}, booktitle = {Internet of Vehicles {\textendash} Technologies and Services}, year = {2014}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, address = {Beijing, China}, 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. }, keywords = {electric vehicles, energy-efficient, flexible routing, profile search, State-based, time-dependent}, isbn = {978-3-319-11166-7}, doi = {http://dx.doi.org/10.1007/978-3-319-11167-4_3}, url = {http://link.springer.com/chapter/10.1007\%2F978-3-319-11167-4_3}, author = {Ren{\'e} Sch{\"o}nfelder and Martin Leucker and Sebastian Walther} }