2026-07-22T21:14:32Z https://drops.dagstuhl.de/oai

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

Faster Preprocessing for the Trip-Based Public Transit Routing Algorithm Lehoux, Vassilissa Loiodice, Christelle Public transit Route planning Algorithms Preprocessing We propose an additional preprocessing step for the Trip-Based Public Transit Routing algorithm, an exact state-of-the art algorithm for bi-criteria min cost path problems in public transit networks. This additional step reduces significantly the preprocessing time, while preserving the correctness and the computation times of the queries. We test our approach on three large scale networks and show that the improved preprocessing is compatible with frequent real-time updates, even on the larger data set. The experiments also indicate that it is possible, if preprocessing time is an issue, to use the proposed preprocessing step on its own to obtain already a significant reduction of the query times compared to the no pruning scenario. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vassilissa Lehoux and Christelle Loiodice 2020 Is Part Of OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2020.3 urn:nbn:de:0030-drops-131395 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.3 eng https://creativecommons.org/licenses/by/3.0/legalcode