Electric Vehicle Travel Planning with Lazy Evaluation of Recharging Times
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00338088" target="_blank" >RIV/68407700:21230/19:00338088 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/SMC.2019.8913902" target="_blank" >https://doi.org/10.1109/SMC.2019.8913902</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/SMC.2019.8913902" target="_blank" >10.1109/SMC.2019.8913902</a>
Alternative languages
Result language
angličtina
Original language name
Electric Vehicle Travel Planning with Lazy Evaluation of Recharging Times
Original language description
The basic premise of existing route planning algorithms is that complete information required for computing optimum routes is available at the time of the search. With the increasing complexity of transport systems, such an assumption is no longer valid as transport service providers are not willing to disclose full information about certain aspects of their services for business sensitivity reasons. Therefore, new approaches capable of computing optimal routes while minimizing the required amount of information about the services are required. In this paper, we investigate the incomplete information route planning problem in the context of planning routes with charging for electric vehicles. We have formalized the problem as a resource-constrained shortest path problem with time-dependent edge costs; the costs are only partially known and their values can be obtained by querying external data sources. We propose an optimum algorithm solving this problem utilizing two interchanging phases built on a multi-objective A* algorithm. We evaluate the properties of the algorithm on a comprehensive suite of test scenarios based on real-world data and derive insights into the properties of this emerging route planning problem.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
2019 IEEE International Conference on Systems, Man and Cybernetics (SMC)
ISBN
978-1-7281-4569-3
ISSN
2577-1655
e-ISSN
—
Number of pages
6
Pages from-to
3168-3173
Publisher name
IEEE
Place of publication
Piscataway
Event location
Bari
Event date
Oct 6, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—