Faster preprocessing for the Trip-Based Public Transit Routing algorithm - Naver Labs Europe
loader image

Abstract

We propose an additional preprocessing step for the Trip-Based Public Transit Routing algorithm, an exact state-of-the art algorithm for bi-criteria min cost path problems in public transit networks. This additional step reduces significantly the preprocessing time, while preserving the correctness and the computation times of the queries.
We test our approach on three large scale networks and show that the improved preprocessing is compatible with real-time updates.