Abstract : This paper presents an algorithm for dynamic travel time computation along Czech Republic highways. The dynamism is represented by speed profiles used for computation of travel times at specified time. These speed profiles have not only the information about an optimal speed, but also a probability of this optimal speed and the probability of the speed which represents the possibility of traffic incident occurrence. Thus, the paper is focused on the analysis of paths with the uncertainty created by traffic incidents. The result of the algorithm is the probability distribution of travel times on a selected path. Based on these results, it is possible to plan a departure time with the best mean travel time for routes along the Czech Republic highways for a specified maximal acceptable travel time. This method will be a part of a larger algorithm for dynamic traffic routing.
Khalid Saeed; Władysław Homenda. 14th Computer Information Systems and Industrial Management (CISIM), Sep 2015, Warsaw, Poland. Springer, Lecture Notes in Computer Science, LNCS-9339, pp.145-153, 2015, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-24369-6_12〉
https://hal.inria.fr/hal-01444461
Contributeur : Hal Ifip
<>
Soumis le : mardi 24 janvier 2017 - 10:40:14
Dernière modification le : mercredi 25 janvier 2017 - 01:04:03
Document(s) archivé(s) le : mardi 25 avril 2017 - 14:14:25
Radek Tomis, Jan Martinovič, Kateřina Slaninová, Lukáš Rapant, Ivo Vondrák. Time-Dependent Route Planning for the Highways in the Czech Republic. Khalid Saeed; Władysław Homenda. 14th Computer Information Systems and Industrial Management (CISIM), Sep 2015, Warsaw, Poland. Springer, Lecture Notes in Computer Science, LNCS-9339, pp.145-153, 2015, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-24369-6_12〉. 〈hal-01444461〉
