# Public Transit Labeling

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 May 2015.

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

- [Dynamic Replanning for Improved Public Transport Routing](https://mlsanity.com/paper/2505.14193/) (2025)

## Abstract (arXiv)

We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approaches either require massive preprocessing effort or provide limited speedups. Leveraging recent advances in Hub Labeling, the fastest algorithm for road networks, we revisit the well-known time-expanded model for public transit. Exploiting domain-specific properties, we provide simple and efficient algorithms for the earliest arrival, profile, and multicriteria problems, with queries that are orders of magnitude faster than the state of the art.