Adapting Dijkstra for Buffers and Unlimited Transfers

ArXi:2603.11729v1 Announce Type: cross In recent years, RAPTOR based algorithms have been considered the state-of-the-art for path-finding with unlimited transfers without preprocessing. However, this status largely stems from the evolution of routing research, where Dijkstra-based solutions were superseded by timetable-based algorithms without a systematic comparison. In this work, we revisit classical Dijkstra-based approaches for public transit routing with unlimited transfers and nstrate that Time-Dependent Dijkstra (TD-Dijkstra) outperforms MR.