Adapting Dijkstra for Buffers and Unlimited Transfers
Researchers have developed a new algorithm called Transfer Aware Dijkstra (TAD) to improve pathfinding in public transit systems. This algorithm correctly accounts for buffer times at stops, which is crucial for transferring passengers. Experiments on London and Switzerland networks demonstrated that TAD achieves over a two-time speed-up compared to existing methods while ensuring optimal routing results. AI
IMPACT Optimizes public transit routing algorithms, potentially improving efficiency and passenger experience.