2026-07-23T17:34:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17118 2024-03-06T10:31:53Z ddc:004 open_access

Efficient Algorithms for Fully Multimodal Journey Planning Potthoff, Moritz Sauer, Jonas Algorithms Journey Planning Multimodal Multicriteria Public Transit We study the journey planning problem for fully multimodal networks consisting of public transit and an arbitrary number of non-schedule-based transfer modes (e.g., walking, e-scooter, bicycle). Obtaining reasonable results in this setting requires multicriteria optimization, making the problem highly complex. Previous approaches were either limited to a single transfer mode or suffered from prohibitively slow running times. We establish a fully multimodal journey planning model that excludes undesirable solutions and can be solved efficiently. We extend existing efficient bimodal algorithms to our model and propose a new algorithm, HydRA, which enables even faster queries. On metropolitan and mid-sized country networks with walking and e-scooter as transfer modes, HydRA achieves query times of around 30 ms, which is fast enough for interactive applications. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Moritz Potthoff and Jonas Sauer 2022 Is Part Of OASIcs, Volume 106, 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2022.14 urn:nbn:de:0030-drops-171181 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.14 eng https://creativecommons.org/licenses/by/4.0/legalcode