Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Drakulic, Darko; Loiodice, Christelle; Lehoux, Vassilissa https://www.dagstuhl.de/lipics License: Creative Commons Attribution 4.0 license (CC BY 4.0)
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-165406
URL:

; ;

Routing in Multimodal Transportation Networks with Non-Scheduled Lines

pdf-format:


Abstract

Over the last decades, new mobility offers have emerged to enlarge the coverage and the accessibility of public transportation systems. In many areas, public transit now incorporates on-demand transport lines, that can be activated at user need. In this paper, we propose to integrate lines without predefined schedules but with predefined stop sequences into a state-of-the-art trip planning algorithm for public transit, the Trip-Based Public Transit Routing algorithm [Witt, 2015]. We extend this algorithm to non-scheduled lines and explain how to model other modes of transportation, such as bike sharing, with this approach. The resulting algorithm is exact and optimizes two criteria: the earliest arrival time and the minimal number of transfers. Experiments on two large datasets show the interest of the proposed method over a baseline modelling.

BibTeX - Entry

@InProceedings{drakulic_et_al:LIPIcs.SEA.2022.6,
  author =	{Drakulic, Darko and Loiodice, Christelle and Lehoux, Vassilissa},
  title =	{{Routing in Multimodal Transportation Networks with Non-Scheduled Lines}},
  booktitle =	{20th International Symposium on Experimental Algorithms (SEA 2022)},
  pages =	{6:1--6:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-251-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{233},
  editor =	{Schulz, Christian and U\c{c}ar, Bora},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16540},
  URN =		{urn:nbn:de:0030-drops-165406},
  doi =		{10.4230/LIPIcs.SEA.2022.6},
  annote =	{Keywords: Multimodal routing, on-demand public transportation, bicriteria shortest paths}
}

Keywords: Multimodal routing, on-demand public transportation, bicriteria shortest paths
Seminar: 20th International Symposium on Experimental Algorithms (SEA 2022)
Issue date: 2022
Date of publication: 11.07.2022


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI