Abstract

This paper addresses the reliable routing problem in stochastic time-dependent networks using actual and forecast information of the traffic flow parameters. We consider the following optimality criterion: maximization the probability of arriving on time at a destination given a departure time and a time budget. The proposed model is compared with an existing algorithm. Conducted experiments show that the proposed method with a slight increase in computational complexity increases the probability of on-time arriving in a stochastic time-dependent network. The proposed algorithm was implemented and tested using the large transport network of Samara, Russia.

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 call

Disclaimer: 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.