Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling

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...

Full description

Saved in:
Bibliographic Details
Published inAnalysis of Experimental Algorithms Vol. 11544; pp. 237 - 247
Main Authors Phan, Duc-Minh, Viennot, Laurent
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2019
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Hub labeling
Public transportation
Route planning
Online AccessGet full text
ISBN9783030340285
3030340287
ISSN0302-9743
1611-3349
DOI10.1007/978-3-030-34029-2_16

Cover

More Information
Summary: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. A research report version is deposited on HAL with number hal-02161283.
Bibliography:D.-M. Phan—This work was mostly performed while this author was at Irif – Paris University, CNRS, France.L. Viennot—Supported by Irif laboratory from CNRS and Paris University, and ANR project Multimod (ANR-17-CE22-0016).
ISBN:9783030340285
3030340287
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-030-34029-2_16