Accelerating Multi-modal Route Planning by Access-Nodes

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.

• Type: Conference
• Year: 2009
• Where: ESA
• Authors: Daniel Delling, Thomas Pajor, Dorothea Wagner
• Keywords: Algorithms, ESA 2009, Public Transportation, Road Networks, Route Planning Algorithms