Scalable Transfer Patterns

Hannah Bast, Matthias Hertel, Sabine Storandt
2015 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)  
We consider the problem of Pareto-optimal route planning in public-transit networks of a whole country, a whole continent, or even the whole world. On such large networks, existing approaches suffer from either a very large space consumption, a very long preprocessing time or slow query processing. Transfer Patterns, a state-of-the-art technique for route planning in transit networks, achieves excellent query times, but the space consumption is large and the preprocessing time is huge. In this
more » ... aper, we introduce a new scheme for the Transfer Pattern precomputation and query graph construction that reduces both the necessary preprocessing time and space consumption by an order of magnitude and more. Average query times are below 1 ms for local queries, independent of the size of the network, around 30 ms for non-local queries on the complete transit network of Germany, and an estimated 200 ms for a fictitious transit network covering the currently available data of the whole world.
doi:10.1137/1.9781611974317.2 dblp:conf/alenex/BastHS16 fatcat:nad2xswwwzdilmfvd3sl7g6bo4