All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Whole Day Mobility Planning with Electric Vehicles

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Whole Day Mobility Planning with Electric Vehicles

  • Original language description

    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.

  • 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

    2018

  • 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

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

  • ISBN

    978-989-758-275-2

  • ISSN

  • e-ISSN

  • Number of pages

    11

  • Pages from-to

    154-164

  • Publisher name

    SciTePress

  • Place of publication

    Madeira

  • Event location

    Funchal, Medeira, Portugal

  • Event date

    Jan 16, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article