On finding $k$ earliest arrival time journeys in public transit networks - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2021

On finding $k$ earliest arrival time journeys in public transit networks

Abstract

Journey planning in (schedule-based) public transit networks has attracted interest from researchers in the last decade. In particular, many algorithms aiming at efficiently answering queries of journey planning have been proposed. However, most of the proposed methods give the user a single or a limited number of journeys in practice, which is undesirable in a transportation context. In this paper, we consider the problem of finding $k$ earliest arrival time journeys in public transit networks from a given origin to a given destination, i.e, an earliest arrival journey from the origin to the destination, a second earliest arrival journey, etc. until the $k^{th}$ earliest arrival journey. For this purpose, we propose an algorithm, denoted by Yen-Public Transit (Y-PT), that extends to public transit networks the algorithm proposed by Yen to find the top-$k$ shortest simple paths in a graph. Moreover, we propose a more refined algorithm, called Postponed Yen-Public Transit (PY-PT), enabling a considerable speed up in practice. Our experiments on several public transit networks show that, in practice, PY-PT is faster than Y-PT by an order of magnitude.
Fichier principal
Vignette du fichier
Multimod_kssp_Hal.pdf (485.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03264788 , version 1 (18-06-2021)

Identifiers

  • HAL Id : hal-03264788 , version 1

Cite

David Coudert, Ali Al Zoobi, Arthur Finkelstein. On finding $k$ earliest arrival time journeys in public transit networks. [Research Report] Inria. 2021. ⟨hal-03264788⟩
159 View
208 Download

Share

Gmail Facebook X LinkedIn More