Time-Dependent SHARC-Routing |
| |
Authors: | Daniel Delling |
| |
Affiliation: | 1.Universit?t Karlsruhe (TH),Karlsruhe,Germany |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|