Abstract
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them, allowing fine-grained modeling. Our experiments on the metropolitan network of London show that the algorithm computes full 24-hour profiles in 70 ms after a preprocessing phase of 30 s, allowing fast queries in dynamic scenarios.
Cite
CITATION STYLE
Witt, S. (2015). Trip-based public transit routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 1025–1036). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_85
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
