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”

Time-Dependent Route Planning for the Highways in the Czech Republic

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86094051" target="_blank" >RIV/61989100:27240/15:86094051 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/15:86094051

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007/978-3-319-24369-6_12" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-319-24369-6_12</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-24369-6_12" target="_blank" >10.1007/978-3-319-24369-6_12</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Time-Dependent Route Planning for the Highways in the Czech Republic

  • Original language description

    This paper presents an algorithm for dynamic travel time computation along Czech Republic highways. The dynamism is represented by speed profiles used for computation of travel times at specified time. These speed profiles have not only the information about an optimal speed, but also a probability of this optimal speed and the probability of the speed which represents the possibility of traffic incident occurrence. Thus, the paper is focused on the analysis of paths with the uncertainty created by traffic incidents. The result of the algorithm is the probability distribution of travel times on a selected path. Based on these results, it is possible to plan a departure time with the best mean travel time for routes along the Czech Republic highways for a specified maximal acceptable travel time. This method will be a part of a larger algorithm for dynamic traffic routing.

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2015

  • 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

    Lecture notes in computer science. Volume 9339

  • ISBN

    978-3-319-24368-9

  • ISSN

    0302-9743

  • e-ISSN

    neuvedeno

  • Number of pages

    9

  • Pages from-to

    145-153

  • Publisher name

    Springer

  • Place of publication

    Basel

  • Event location

    Varšava

  • Event date

    Sep 24, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000366016000012