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”

Integrated Route, Charging and Activity Planning for Whole Day Mobility 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%2F19%3A00329314" target="_blank" >RIV/68407700:21230/19:00329314 - isvavai.cz</a>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • 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

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

  • ISBN

    978-3-030-05452-6

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    274-289

  • Publisher name

    Springer Nature Switzerland AG

  • Place of publication

    Basel

  • Event location

    Funchal, Madeira

  • Event date

    Jan 16, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article