DMCA
Time-Dependent SHARC-Routing (2008)
Cached
Download Links
- [i11www.iti.uni-karlsruhe.de]
- [i11www.iti.uni-karlsruhe.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 16th Annual European Symposium on Algorithms (ESA’08 |
| Citations: | 17 - 9 self |
BibTeX
@INPROCEEDINGS{Delling08time-dependentsharc-routing,
author = {Daniel Delling},
title = {Time-Dependent SHARC-Routing},
booktitle = {In Proceedings of the 16th Annual European Symposium on Algorithms (ESA’08},
year = {2008},
pages = {332--343},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In recent years, many speed-up techniques for Dijkstra’s algorithm have been developed that make the computation of shortest paths in static road networks a matter of microseconds. However, only few of those techniques work in time-dependent networks which, unfortunately, appear quite frequently in reality: Roads are predictably congested by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an efficient time-dependent route planning algorithm. It is based on our recently introduced SHARC algorithm, which we adapt by augmenting its basic ingredients such that correctness can still be guaranteed in a time-dependent scenario. As a result, we are able to efficiently compute exact shortest paths in time-dependent continental-sized transporta-tion networks, both of roads and of railways. It should be noted that time-dependent SHARC was the first efficient algorithm for time-dependent route planning. 1
Keyphrases
time-dependent sharc-routing time-dependent network traffic jam first efficient algorithm efficient timetable information system basic ingredient static road recent year time-dependent route planning time-dependent scenario dijkstra algorithm shortest path time-dependent continental-sized transporta-tion network fast technique sharc algorithm many speed-up technique time-dependent sharc efficient time-dependent route planning algorithm
