Integrated Route, Charging and Activity Planning for Whole Day Mobility with Electric Vehicles

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00329314" target="_blank" >RIV/68407700:21230/19:00329314 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007/978-3-030-05453-3_13" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-030-05453-3_13</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-05453-3_13" target="_blank" >10.1007/978-3-030-05453-3_13</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Integrated Route, Charging and Activity Planning for Whole Day Mobility with Electric Vehicles

Popis výsledku v původním jazyce

Over the last two decades, route planning algorithms have revolutionized the way we organize car travel. The advent of electric vehicles (EVs), however, bring new challenges for travel planning. Because of electric vehicle limited range and long charging times, it is beneficial to plan routes, charging, and activities jointly and in the context of the whole day—rather than for single, isolate journeys as done by standard route planning approaches. In this work, we therefore present a novel approach to solving such a whole day mobility problem. Our method works by first preprocessing an energy-constrained route planning problem and subsequently planning the temporally and spatially constrained activities. We propose both an optimal algorithm for the day mobility planning problem and a set of sub-optimal speedup heuristics. We evaluate the proposed algorithm on a set of benchmarks based on real-world data and show that it is significantly faster than the previous state-of-the-art approach. Moreover, the speedups provide dramatic memory and time improvements with a negligible loss in solution quality.

Název v anglickém jazyce

Integrated Route, Charging and Activity Planning for Whole Day Mobility with Electric Vehicles

Popis výsledku anglicky

Over the last two decades, route planning algorithms have revolutionized the way we organize car travel. The advent of electric vehicles (EVs), however, bring new challenges for travel planning. Because of electric vehicle limited range and long charging times, it is beneficial to plan routes, charging, and activities jointly and in the context of the whole day—rather than for single, isolate journeys as done by standard route planning approaches. In this work, we therefore present a novel approach to solving such a whole day mobility problem. Our method works by first preprocessing an energy-constrained route planning problem and subsequently planning the temporally and spatially constrained activities. We propose both an optimal algorithm for the day mobility planning problem and a set of sub-optimal speedup heuristics. We evaluate the proposed algorithm on a set of benchmarks based on real-world data and show that it is significantly faster than the previous state-of-the-art approach. Moreover, the speedups provide dramatic memory and time improvements with a negligible loss in solution quality.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Agents and Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

ISBN

978-3-030-05452-6

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

16

Strana od-do

274-289

Název nakladatele

Springer Nature Switzerland AG

Místo vydání

Basel

Místo konání akce

Funchal, Madeira

Datum konání akce

16. 1. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—