Abstract
This paper addresses the problem of finding reliable a priori shortest path to maximize the probability of arriving on time in a stochastic and time-dependent network. Optimal solutions to the problem can be obtained from finding non-dominated paths, which are defined based on first-order stochastic dominance. We formulate the problem of finding non-dominated paths as a general dynamic programming problem because Bellman's principle of optimality can be applied to construct non-dominated paths. A label-correcting algorithm is designed to find optimal paths based on the new proporty for which Bellman's Principle holds. Numerical results are provided using a small 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.
