# Trip-Based Public Transit Routing

arXiv: https://arxiv.org/abs/1504.07149 · HTML: https://mlsanity.com/paper/1504.07149/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Apr 2015.

## Built on by (most cited first, 3 of 3)

- [Adapting Dijkstra for Buffers and Unlimited Transfers](https://mlsanity.com/paper/2603.11729/) (2026)
- [Early Pruning for Public Transport Routing](https://mlsanity.com/paper/2603.12592/) (2026)
- [LegalFarePlan: A Label-Setting Framework for Fare-Transparent Urban Rail Route Planning under Non-Additive Fare Rules](https://mlsanity.com/paper/2607.09755/) (2026)

## Abstract (arXiv)

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.