Arc-Flags Meet Trip-Based Public Transit Routing
Ernestine Gro{\ss}mann, Jonas Sauer, Christian Schulz, Patrick Steil

TL;DR
This paper introduces Arc-Flag TB, a fast journey planning algorithm for public transit that combines Trip-Based Routing with Arc-Flags, achieving significant speedups and reduced memory usage while maintaining accuracy.
Contribution
The paper presents a novel combination of Arc-Flags with Trip-Based Public Transit Routing, improving speed and memory efficiency over previous methods.
Findings
Achieves up to 100x speedup over TB
Provides query times under one millisecond on large networks
Reduces memory usage compared to TB-CST
Abstract
We present Arc-Flag TB, a journey planning algorithm for public transit networks which combines Trip-Based Public Transit Routing (TB) with the Arc-Flags speedup technique. Compared to previous attempts to apply Arc-Flags to public transit networks, which saw limited success, our approach uses stronger pruning rules to reduce the search space. Our experiments show that Arc-Flag TB achieves a speedup of up to two orders of magnitude over TB, offering query times of less than a millisecond even on large countrywide networks. Compared to the state-of-the-art speedup technique Trip-Based Public Transit Routing Using Condensed Search Trees (TB-CST), our algorithm achieves similar query times but requires significantly less additional memory. Other state-of-the-art algorithms which achieve even faster query times, e.g., Public Transit Labeling, require enormous memory usage. In contrast,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Vehicle Routing Optimization Methods
