During the last years, many speed-up techniques for Dijkstra 's algorithm have been developed. As a result, computing a shortest path in a staticroad network is a matter of microseconds. However, only few of those techniques work in time-dependentnetworks. 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 exacttime-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.
Document type: Part of book or chapter of book
The different versions of the original document can be found in:
Published on 01/01/2008
Volume 2008, 2008
DOI: 10.1007/978-3-540-87744-8_28
Licence: CC BY-NC-SA license
Are you one of the authors of this document?