Problem
Research questions and friction points this paper is trying to address.
Optimization
Public Transportation
Query Efficiency
FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing
🤖 AI Summary
To address the inefficiency and high memory overhead of path queries in large-scale public transit networks, this paper proposes a novel time-dependent routing algorithm that integrates Arc-Flags with the trip-based paradigm. It is the first work to adapt Arc-Flags to transit networks, resolving their inherent incompatibility with temporal constraints—specifically, pruning failure due to time-dependent transfer feasibility—via configurable grid partitioning and precomputed transfer feasibility labeling. This yields a lossless space–time trade-off. Compared to the baseline trip-based method, the approach achieves over 100× speedup in query latency, enabling sub-millisecond responses; reduces memory consumption by two orders of magnitude; and incurs preprocessing overhead comparable to state-of-the-art methods. The resulting framework balances high accuracy, ultra-low latency, and lightweight storage, making it suitable for real-time, large-scale transit navigation systems.
📝 Abstract
We present FLASH-TB, a journey planning algorithm for public transit networks that combines Trip-Based Public Transit Routing (TB) with the Arc-Flags speedup technique. The basic idea is simple: The network is partitioned into a configurable number of cells. For each cell and each possible transfer between two vehicles, the algorithm precomputes a flag that indicates whether the transfer is required to reach the cell. During a query, only flagged transfers are explored. Our algorithm improves upon previous attempts to apply Arc-Flags to public transit networks, which saw limited success due to conflicting rules for pruning the search space. We show that these rules can be reconciled while still producing correct results. Because the number of cells is configurable, FLASH-TB offers a tradeoff between query time and memory consumption. It is significantly more space-efficient than existing techniques with a comparable preprocessing time, which store generalized shortest-path trees: to match their query performance, it requires up to two orders of magnitude less memory. The fastest configuration of FLASH-TB achieves a speedup of more than two orders of magnitude over TB, offering sub-millisecond query times even on large countrywide networks.
Innovation
Methods, ideas, or system contributions that make the work stand out.
FLASH-TB
Trip-based Planning
Memory Efficiency
🔎 Similar Papers
No similar papers found.
