Trip-Based Public Transit Routing
arXiv:1504.07149 · doi:10.1007/978-3-662-48350-3_85
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.
Minor corrections, no substantial changes. To be presented at ESA 2015