A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Scalable Transfer Patterns
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
doi:10.1137/1.9781611974317.2
dblp:conf/alenex/BastHS16
fatcat:nad2xswwwzdilmfvd3sl7g6bo4