Abstract
Accidents, bad weather, traffic congestion, etc. contribute to the uncertainties of travel times in real-life transportation networks, which greatly affect the quality of individual life and the reliability of transportation system. In this paper, optimal routing problem is addressed in dynamic transportation networks with random link travel times. Taking the reliability of travel time into consideration, the robust schedule delay is used as the criterion of optimality to evaluate the paths, which is defined as minimizing the largest difference between the actual arriving time and the desired arrival time in dynamic stochastic networks. Under the stochastic consistent condition, a mathematic proof is given to simplify the problem. Then an exact modified Dijkstra's algorithm is designed for finding the optimal routing in STD networks and its computation complexity is calculated as a polynomial-time o(n2 *e). The validity of the proposed algorithm is also confirmed by conducting a test in a sampled network.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
