4 papers
Adapting Dijkstra for Buffers and Unlimited Transfers
Denys Katkalo, Andrii Rohovyi, Toby Walsh
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 ste…
Early Pruning for Public Transport Routing
Andrii Rohovyi, Abdallah Abuaisha, Toby Walsh
Routing algorithms for public transport, particularly the widely used RAPTOR and its variants, often face performance bottlenecks during the transfer relaxation phase, especially o…
Fast and Memory Efficient Multimodal Journey Planning with Delays
Denys Katkalo, Andrii Rohovyi, Toby Walsh
State-of-the-art multimodal journey-planning algorithms, such as ULTRA, have recently been adapted to account for delays. In this work, we extend this approach to be more memory-ef…
Timetable Nodes for Public Transport Network
Andrii Rohovyi, Peter J. Stuckey, Toby Walsh
Faster pathfinding in time-dependent transport networks is an important and challenging problem in navigation systems. There are two main types of transport networks: road networks…