Latest revision as of 11:18, 25 January 2021

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. A research report version is deposited on HAL with number hal-02161283.

Original document

The different versions of the original document can be found in:

• http://arxiv.org/abs/1906.08971

• http://arxiv.org/pdf/1906.08971

• http://dx.doi.org/10.1007/978-3-030-34029-2_16

• http://link.springer.com/content/pdf/10.1007/978-3-030-34029-2_16,

http://dx.doi.org/10.1007/978-3-030-34029-2_16 under the license http://www.springer.com/tdm

• https://dblp.uni-trier.de/db/journals/corr/corr1906.html#abs-1906-08971,

https://hal.inria.fr/hal-02161283,

https://arxiv.org/abs/1906.08971,

https://hal.inria.fr/hal-02161283/document,

https://link.springer.com/chapter/10.1007/978-3-030-34029-2_16,

http://arxiv.org/pdf/1906.08971.pdf,

https://academic.microsoft.com/#/detail/2990953458

• https://hal.inria.fr/hal-02161283,

https://hal.inria.fr/hal-02161283/document,

https://hal.inria.fr/hal-02161283/file/arxiv.pdf