Fast Public Transit Routing with Unrestricted Walking through Hub Labeling

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-02161283
Contributor : Laurent Viennot <>
Submitted on : Thursday, June 20, 2019 - 3:56:44 PM
Last modification on : Tuesday, October 29, 2019 - 2:08:03 PM

Files

arxiv.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02161283, version 1
  • ARXIV : 1906.08971

Citation

Duc-Minh Phan, Laurent Viennot. Fast Public Transit Routing with Unrestricted Walking through Hub Labeling. Special Event on Analysis of Experimental Algorithms (SEA2), Jun 2019, Kalamata, Greece. ⟨hal-02161283⟩

Share

Metrics

Record views

34

Files downloads

470