Engineering Fast Route Planning Algorithms

Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s algorithm. We outline ideas, algorithms, implementations, and experimental methods behind this development. We also explain why the story is not over yet because dynamically changing networks, flexible objective functions, and new applications pose a lot of interesting challenges.

• Type: Conference
• Year: 2007
• Where: WEA
• Authors: Peter Sanders, Dominik Schultes
• Keywords: Algorithms, Route Planning, Transportation Networks, WEA 2007, flexible Objective Functions