2026-07-22T00:07:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16540 2024-03-06T10:57:45Z ddc:004 open_access

Routing in Multimodal Transportation Networks with Non-Scheduled Lines Drakulic, Darko Loiodice, Christelle Lehoux, Vassilissa Multimodal routing on-demand public transportation bicriteria shortest paths 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Darko Drakulic and Christelle Loiodice and Vassilissa Lehoux 2022 Is Part Of LIPIcs, Volume 233, 20th International Symposium on Experimental Algorithms (SEA 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2022.6 urn:nbn:de:0030-drops-165406 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.6 eng https://creativecommons.org/licenses/by/4.0/legalcode