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”

The ε-approximation of the Label Correcting Modification of the Dijkstra's Algorithm

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F19%3A43956499" target="_blank" >RIV/49777513:23520/19:43956499 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.scitepress.org/PublicationsDetail.aspx?ID=3Yjqni%2fbuu4%3d&t=1" target="_blank" >https://www.scitepress.org/PublicationsDetail.aspx?ID=3Yjqni%2fbuu4%3d&t=1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5220/0007658200260032" target="_blank" >10.5220/0007658200260032</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The ε-approximation of the Label Correcting Modification of the Dijkstra's Algorithm

  • Original language description

    This paper is focused on searching the shortest paths for all departure times (profile search). This problem is called a time-dependent shortest path problem (TDSP) and is important for optimization in transportation. Particularly this paper deals with the ε-approximation of TDSP. The proposed algorithm is based on a label correcting modification of Dijkstra&apos;s algorithm (LCA). The main idea of the algorithm is to simplify the arrival function after every relaxation step so that the maximum relative error is maintained. When the maximum relative error is 0.001, the proposed solution saves more than 95% of breakpoints and 80% time compared to the exact version of LCA. A more efficient precomputation step for another time-dependent routing algorithms can be built using the developed algorithm.

  • 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

    GISTAM 2019 - Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management2019

  • ISBN

    978-989-758-371-1

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    26-32

  • Publisher name

    SciTePress

  • Place of publication

    Heraklion

  • Event location

    Heraklion, Crete, Greece

  • Event date

    May 3, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000570535400002