Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a multi-modal scenario: we start by car to reach the nearest train station, ride the train to the airport, fly to an airport near our destination and finally take a taxi. In other words, we need to incorporate public transportation into road networks. However, we do not want to switch the type of transportation too often. We end up in a label constrained variant of the shortest path problem. In this work, we present a first efficient solution to a restricted variant of this problem including experimental results for transportation networks with up to 125 Mio. edges. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Delling, D., Pajor, T., & Wagner, D. (2009). Accelerating multi-modal route planning by access-nodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5757 LNCS, pp. 587–598). https://doi.org/10.1007/978-3-642-04128-0_53
Mendeley helps you to discover research relevant for your work.