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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Sanders, P., & Schultes, D. (2007). Engineering fast route planning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 23–36). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_2
Mendeley helps you to discover research relevant for your work.