Speeding up shortest path search in public transport networks

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00207439" target="_blank" >RIV/00216208:11320/09:00207439 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Speeding up shortest path search in public transport networks

Original language description

The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that speed up the given calculation. The approach, when the calculation is not performed onthe original network but on the simplified one, seems to be very promising. The path found in the simplified network can be easily mapped to a corresponding path in the original network. In the case of the Prague public transport the simplified networkhas several times less nodes and the computation is speeded up correspondingly.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

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>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

DATESO 2009

ISBN

978-80-01-04323-3

ISSN

—

e-ISSN

—

Number of pages

12

Pages from-to

—

Publisher name

Czech Technical University in Prague

Place of publication

—

Event location

Neuveden

Event date

Jan 1, 2009

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

000272412300001