Connection Scan Accelerated

We study the problem of efficiently computing journeys in timetable networks. Our algorithm optimally answers profile queries, computing all journeys given a time interval. Our study demonstrates that queries can be answered optimally on large country-scale timetable networks within several milliseconds and fast delay integration is possible. Previous work either had to drop optimality or only considered comparatively small timetable networks. Our technique is a combination of the Connection Scan Algorithm and multilevel overlay graphs.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Matthias Müller-Hannemann,et al.  Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks , 2010, SEA.

[3]  Matthias Müller-Hannemann,et al.  Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected , 2009, ATMOS.

[4]  Yann Disser,et al.  Multi-criteria Shortest Paths in Time-Dependent Train Networks , 2008, WEA.

[5]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[6]  Andrew V. Goldberg,et al.  Graph Partitioning with Natural Cuts , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[7]  Erik Carlsson,et al.  Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns , 2010, ESA.

[8]  Daniel Delling,et al.  Round-Based Public Transit Routing , 2015 .

[9]  Robert Geisberger.  Contraction of Timetable Networks with Realistic Transfers , 2010, SEA.

[10]  Christos D. Zaroliagis,et al.  Using Multi-level Graphs for Timetable Information in Railway Systems , 2002, ALENEX.

[11]  Daniel Delling,et al.  Faster Customization of Road Networks , 2013, SEA.

[12]  George Karypis,et al.  Multi-threaded Graph Partitioning , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[13]  Dorothea Wagner,et al.  Engineering multilevel overlay graphs for shortest-path queries , 2009, JEAL.

[14]  Ben Strasser,et al.  Intriguingly Simple and Fast Transit Routing , 2013, SEA.

[15]  Karsten Weihe,et al.  Dijkstra's algorithm on-line: an empirical case study from public railroad transport , 2000, JEAL.

[16]  Sabine Storandt,et al.  Delay-Robustness of Transfer Patterns in Public Transportation Route Planning , 2013, ATMOS.

[17]  Peter Sanders,et al.  Think Locally, Act Globally: Highly Balanced Graph Partitioning , 2013, SEA.

[18]  Andrew V. Goldberg,et al.  Customizable Route Planning , 2011, SEA.

[19]  Christos D. Zaroliagis,et al.  Efficient models for timetable information in public transportation systems , 2008, JEAL.