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”

Achieving Full Plan Multimodality by Integrating Multiple Incomplete Journey Planners

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00232968" target="_blank" >RIV/68407700:21230/15:00232968 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/ITSC.2015.234" target="_blank" >http://dx.doi.org/10.1109/ITSC.2015.234</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ITSC.2015.234" target="_blank" >10.1109/ITSC.2015.234</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Achieving Full Plan Multimodality by Integrating Multiple Incomplete Journey Planners

  • Original language description

    Although in principle, providing a fully multimodal journey planner supporting the planning with all types of transport services and their combinations is now algorithmically possible, providing such fully multimodal journey planning in practice remainselusive. This situation is largely caused by the fact a fully multimodal journey planner requires a wealth of detailed data about all transport services and these are often difficult and/or costly to obtain. In this paper, we present a novel, elegant approach to overcome this problem. Our approach is based on journey planner integration ? it obtains a fully multimodal journey planning capability by interconnecting, in a smart way, multiple incomplete journey planners, each with only limited modal and/orgeographical coverage. The integration relies on a planning metagraph, a simplified representation of the underlying transport system which can be build with only a minimum amount of data. We have successfully tested our approach in real

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    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

    Proccedings of the 18th IEEE International Conference on Intelligent Transportation Systems

  • ISBN

    978-1-4673-6595-6

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    1430-1435

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Las Canteras

  • Event date

    Sep 15, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article