Adapting Dijkstra for Buffers and Unlimited Transfers 事件

Adapting Dijkstra for Buffers and Unlimited Transfers arXiv:2603.11729v5 Announce Type: replace-cross Abstract: 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 appr