Chapter

Algorithm Engineering

Volume 9220 of the series Lecture Notes in Computer Science pp 19-80

Date:

Route Planning in Transportation Networks

  • Hannah BastAffiliated withUniversity of Freiburg
  • , Daniel DellingAffiliated withApple Inc.
  • , Andrew GoldbergAffiliated withAmazon
  • , Matthias Müller-HannemannAffiliated withMartin-Luther-Universität Halle-Wittenberg
  • , Thomas PajorAffiliated withMicrosoft Research Email author 
  • , Peter SandersAffiliated withKarlsruhe Institute of Technology
  • , Dorothea WagnerAffiliated withKarlsruhe Institute of Technology
  • , Renato F. WerneckAffiliated withAmazon

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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 simplifications or heavy preprocessing. 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.