Engineering Route Planning Algorithms (2009)
| Venue: | ALGORITHMICS OF LARGE AND COMPLEX NETWORKS. LECTURE NOTES IN COMPUTER SCIENCE |
| Citations: | 10 - 10 self |
BibTeX
@INPROCEEDINGS{Delling09engineeringroute,
author = {Daniel Delling and Peter Sanders and Dominik Schultes and Dorothea Wagner},
title = { Engineering Route Planning Algorithms},
booktitle = {ALGORITHMICS OF LARGE AND COMPLEX NETWORKS. LECTURE NOTES IN COMPUTER SCIENCE},
year = {2009},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
