Whole Day Mobility Planning with Electric Vehicles

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00322130" target="_blank" >RIV/68407700:21230/18:00322130 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.scitepress.org/Papers/2018/65985/65985.pdf" target="_blank" >http://www.scitepress.org/Papers/2018/65985/65985.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Whole Day Mobility Planning with Electric Vehicles

Popis výsledku v původním jazyce

We propose a novel and challenging variant of trip planning problems – Whole Day Mobility Planning with Electric Vehicles (WDMEV). WDMEV combines several concerns, which has been so far only considered separately, in order to realistically model the problem of planning mobility with electric vehicles (EVs). A key difference between trip planning for combustion engine cars and trip planning for EVs is the comparatively lower battery capacity and comparatively long charging times of EVs – which makes it important to carefully consider charging when planning travel. The key idea behind WDMEV is that the user can better optimize his/her mobility with EVs, if it considers the activities he/she needs to perform and the travel required to get to the locations of these activities for the whole day - rather than planning for single trips only. In this paper, we formalize the WDMEV problem and propose a solution based on a label-setting heuristic search algorithm, including several speed-ups. We evaluate the proposed algorithm on a realistic set of benchmark problems, confirming that the whole day approach reduces the time required to complete one’s day travel with EVs and that it also makes it cheaper, compared to the traditional single-trip approach.

Název v anglickém jazyce

Whole Day Mobility Planning with Electric Vehicles

Popis výsledku anglicky

We propose a novel and challenging variant of trip planning problems – Whole Day Mobility Planning with Electric Vehicles (WDMEV). WDMEV combines several concerns, which has been so far only considered separately, in order to realistically model the problem of planning mobility with electric vehicles (EVs). A key difference between trip planning for combustion engine cars and trip planning for EVs is the comparatively lower battery capacity and comparatively long charging times of EVs – which makes it important to carefully consider charging when planning travel. The key idea behind WDMEV is that the user can better optimize his/her mobility with EVs, if it considers the activities he/she needs to perform and the travel required to get to the locations of these activities for the whole day - rather than planning for single trips only. In this paper, we formalize the WDMEV problem and propose a solution based on a label-setting heuristic search algorithm, including several speed-ups. We evaluate the proposed algorithm on a realistic set of benchmark problems, confirming that the whole day approach reduces the time required to complete one’s day travel with EVs and that it also makes it cheaper, compared to the traditional single-trip approach.

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í

2018

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

Proceedings of the 10th International Conference on Agents and Artificial Intelligence

ISBN

978-989-758-275-2

ISSN

—

e-ISSN

—

Počet stran výsledku

11

Strana od-do

154-164

Název nakladatele

SciTePress

Místo vydání

Madeira

Místo konání akce

Funchal, Medeira, Portugal

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

—