Skip to Main content Skip to Navigation
Conference papers

Delay-Robustness of Transfer Patterns in Public Transportation Route Planning

Abstract : Transfer pattern routing is a state-of-the-art speed-up technique for finding optimal paths which minimize multiple cost criteria in public transportation networks. It precomputes sequences of transfer stations along optimal paths. At query time, the optimal paths are searched among the stored transfer patterns, which allows for very fast response times even on very large networks. On the other hand, even a minor change to the timetables may affect many optimal paths, so that, in principle, a new computation of all optimal transfer patterns becomes necessary. In this paper, we examine the robustness of transfer pattern routing towards delay, which is the most common source of such updates. The intuition is that the deviating paths caused by typical updates are already covered by original transfer patterns. We perform experiments which show that the transfer patterns are remarkably robust even to large and many delays, which underlines the applicability and reliability of transfer pattern routing in realistic routing applications.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, October 10, 2013 - 11:59:20 AM
Last modification on : Friday, October 11, 2013 - 1:33:33 PM
Long-term archiving on: : Friday, April 7, 2017 - 8:58:06 AM


Files produced by the author(s)




Hannah Bast, Jonas Sternisko, Sabine Storandt. Delay-Robustness of Transfer Patterns in Public Transportation Route Planning. ATMOS - 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - 2013, Sep 2013, Sophia Antipolis, France. pp.42--54, ⟨10.4230/OASIcs.ATMOS.2013.42⟩. ⟨hal-00871735⟩



Record views


Files downloads