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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009). Engineering route planning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5515 LNCS, pp. 117–139). https://doi.org/10.1007/978-3-642-02094-0_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
