Chapter

Algorithmics of Large and Complex Networks

Volume 5515 of the series Lecture Notes in Computer Science pp 117-139

Engineering Route Planning Algorithms

  • Daniel DellingAffiliated withUniversität Karlsruhe (TH)
  • , Peter SandersAffiliated withUniversität Karlsruhe (TH)
  • , Dominik SchultesAffiliated withUniversität Karlsruhe (TH)
  • , Dorothea WagnerAffiliated withUniversität Karlsruhe (TH)

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-dependent routing, and flexible objective functions.