Route Planning in Transportation Networks

  • Daniel Delling ,
  • Andrew Goldberg ,
  • Matthias Muller-Hannemann ,
  • Thomas Pajor ,
  • Peter Sanders ,
  • Dorthea Wagner ,
  • Renato Werneck

MSR-TR-2014-4 |

Note: This article is outdated. The most recent version can be found at

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires approximations or simplifications. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.