# Fast Public Transit Routing with Unrestricted Walking through Hub Labeling

## TL;DR

This paper introduces a hub labeling method for public transit routing that enables unrestricted walking, significantly improving query speed for various journey types compared to existing contraction hierarchy methods.

## Contribution

The paper presents a novel hub labeling technique for public transit routing that supports unlimited walking and adapts to multiple algorithms, enhancing query efficiency.

## Key findings

- Significant speedup over contraction hierarchy-based methods.
- Supports various query types including earliest arrival and Pareto-optimal journeys.
- Effective adaptation to RAPTOR and CSA algorithms.

## Abstract

We propose a novel technique for answering routing queries in public transportation networks that allows unrestricted walking. We consider several types of queries: earliest arrival time, Pareto-optimal journeys regarding arrival time, number of transfers and walking time, and profile, i.e. finding all Pareto-optimal journeys regarding travel time and arrival time in a given time interval. Our techniques uses hub labeling to represent unlimited foot transfers and can be adapted to both classical algorithms RAPTOR and CSA. We obtain significant speedup compared to the state-of-the-art approach based on contraction hierarchies.