Dynamic Time-Dependent Route Planning in Road Networks with User Preferences
Algorithms for computing driving directions on road networks often presume constant costs on each arc. In practice, the current traffic situation significantly influences the travel time. One can distinguish traffic congestion that can be predicted using historical traffic data, and congestion due t...
Saved in:
Published in | Experimental Algorithms Vol. 9685; pp. 33 - 49 |
---|---|
Main Authors | , , , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2016
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
ISBN | 3319388509 9783319388502 |
ISSN | 0302-9743 1611-3349 |
DOI | 10.1007/978-3-319-38851-9_3 |
Cover
Summary: | Algorithms for computing driving directions on road networks often presume constant costs on each arc. In practice, the current traffic situation significantly influences the travel time. One can distinguish traffic congestion that can be predicted using historical traffic data, and congestion due to unpredictable events, e. g., accidents. We study the dynamic and time-dependent route planning problem, which takes both live traffic and long-term prediction into account. We propose a practical algorithm that, while robust to user preferences, is able to integrate global changes of the time-dependent metric faster than previous approaches and allows queries in the order of milliseconds. |
---|---|
Bibliography: | Partially supported by EU grants 288094 (eCOMPASS) and 609026 (MOVE-SMART). |
ISBN: | 3319388509 9783319388502 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-319-38851-9_3 |