During the last years, many speed-up techniques for Dijkstra's algorithm have been developed. As a result, computing a shortest path in a static road network is a matter of microseconds. However, only few of those techniques work in time-dependent networks. Unfortunately, such networks appear frequentely in reality: Roads are predictably congestured 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 exact time-dependent speed-up technique based on our recent SHARC-algorithm. As a result, we are able to efficiently compute shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Delling, D. (2008). Time-dependent SHARC-routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 332–343). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_28
Mendeley helps you to discover research relevant for your work.