Sciweavers

Share
WEA
2007
Springer

Engineering Fast Route Planning Algorithms

9 years 3 months ago
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.
Peter Sanders, Dominik Schultes
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where WEA
Authors Peter Sanders, Dominik Schultes
Comments (0)
books