License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2017.19
URN: urn:nbn:de:0030-drops-76088
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7608/
Baum, Moritz ;
Sauer, Jonas ;
Wagner, Dorothea ;
Zündorf, Tobias
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications
Abstract
In route planning for electric vehicles (EVs), consumption profiles are a functional representation of optimal energy consumption between two locations, subject to initial state of charge. Efficient computation of profiles is a relevant problem on its own, but also a fundamental ingredient to many route planning approaches for EVs. In this work, we show that the complexity of a profile is at most linear in the graph size. Based on this insight, we derive a polynomial-time algorithm for the problem of finding an energy-optimal path between two locations that allows stops at charging stations. Exploiting efficient profile search, our approach also allows partial recharging at charging stations to save energy. In a sense, our results close the gap between efficient techniques for energy-optimal routes (based on simpler models) and NP-hard time-constrained problems involving charging stops for EVs. We propose a practical implementation, which we carefully integrate with Contraction Hierarchies and A* search. Even though the practical variant formally drops correctness, a comprehensive experimental study on a realistic, large-scale road network reveals that it always finds the optimal solution in our tests and computes even long-distance routes with charging stops in less than 300 ms.
BibTeX - Entry
@InProceedings{baum_et_al:LIPIcs:2017:7608,
author = {Moritz Baum and Jonas Sauer and Dorothea Wagner and Tobias Z{\"u}ndorf},
title = {{Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications}},
booktitle = {16th International Symposium on Experimental Algorithms (SEA 2017)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-036-1},
ISSN = {1868-8969},
year = {2017},
volume = {75},
editor = {Costas S. Iliopoulos and Solon P. Pissis and Simon J. Puglisi and Rajeev Raman},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7608},
URN = {urn:nbn:de:0030-drops-76088},
doi = {10.4230/LIPIcs.SEA.2017.19},
annote = {Keywords: electric vehicles, charging station, shortest paths, route planning, profile search, algorithm engineering}
}
|
Keywords: |
|
electric vehicles, charging station, shortest paths, route planning, profile search, algorithm engineering |
|
Collection: |
|
16th International Symposium on Experimental Algorithms (SEA 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
07.08.2017 |
