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.
CITATION STYLE
Baum, M., Dibbelt, J., Pajor, T., & Wagner, D. (2016). Dynamic time-dependent route planning in road networks with user preferences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9685, pp. 33–49). Springer Verlag. https://doi.org/10.1007/978-3-319-38851-9_3
Mendeley helps you to discover research relevant for your work.