Engineering Route Planning Algorithms

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.

• Type: Conference
• Year: 2009
• Where: DFG
• Authors: Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
• Keywords: DFG 2009, Distributed And Parallel Computing, Route Planning, Transportation Networks, flexible Objective Functions