Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00209841" target="_blank" >RIV/68407700:21230/13:00209841 - isvavai.cz</a>
Result on the web
<a href="http://agents.fel.cvut.cz/~hrncir/publications/hrncir2013_ITSC.pdf" target="_blank" >http://agents.fel.cvut.cz/~hrncir/publications/hrncir2013_ITSC.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ITSC.2013.6728545" target="_blank" >10.1109/ITSC.2013.6728545</a>
Alternative languages
Result language
angličtina
Original language name
Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning
Original language description
We solve the fully multimodal journey planning problem, in which journey plans can employ any combination of scheduled public transport (e.g., bus, tram and underground), individual (e.g., walk, bike, shared bike and car), and on-demand (e.g., taxi) transport modes. Our solution is based on a generalised time-dependent graph that allows representing the fully multimodal earliest arrival problem as a standard graph search problem and consequently using general shortest path algorithms to solve it. In addition, to allow users to express their journey planning preferences and to speed up the search process, flexible journey plan templates can be used in our approach to restrict the transport modes and mode combinations permitted in generated journey plans. We have evaluated our solution on a real-world transport network of the city of Helsinki and achieved practically usable search runtimes in the range of hundreds of milliseconds.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
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
2013
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 16th International IEEE Conference on Intelligent Transportation Systems
ISBN
978-1-4799-2914-6
ISSN
2153-0009
e-ISSN
—
Number of pages
8
Pages from-to
2138-2145
Publisher name
Curran Associates
Place of publication
Red Hook, NY
Event location
Haag
Event date
Oct 6, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000346481000343