AI RESEARCH
Early Pruning for Public Transport Routing
arXiv CS.AI
•
ArXi:2603.12592v1 Announce Type: cross Routing algorithms for public transport, particularly the widely used RAPTOR and its variants, often face performance bottlenecks during the transfer relaxation phase, especially on dense transfer graphs, when ing unlimited transfers. This inefficiency arises from iterating over many potential inter-stop connections (walks, bikes, e-scooters, etc.