Fast Public Transit Routing with Unrestricted Walking through Hub Labeling - Archive ouverte HAL Access content directly
Conference Papers Year :

Fast Public Transit Routing with Unrestricted Walking through Hub Labeling

(1) , (2, 3, 4, 5)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
arxiv.pdf (159.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02161283 , version 1 (20-06-2019)

Identifiers

Cite

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⟩
81 View
359 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More