2026-10-11T16:10:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6534 2024-03-06T09:30:02Z ddc:004 open_access

Trip-Based Public Transit Routing Using Condensed Search Trees Witt, Sascha Public Transit Routing Public Transport Route Planning We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the trip-based model focuses on trips and transfers between them, constructing journeys as a sequence of trips. In this paper, we develop a speed-up technique for this model inspired by principles behind existing state-of-the-art speed-up techniques, Transfer Patterns and Hub Labelling. The resulting algorithm allows us to compute Pareto-optimal (with respect to arrival time and number of transfers) 24-hour profiles on very large real-world networks in less than half a millisecond. Compared to the current state of the art for bicriteria queries on public transit networks, this is up to two orders of magnitude faster, while increasing preprocessing overhead by at most one order of magnitude. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sascha Witt 2016 Is Part Of OASIcs, Volume 54, 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2016.10 urn:nbn:de:0030-drops-65341 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2016.10 eng https://creativecommons.org/licenses/by/3.0/legalcode