The Stochastic Time-Varying Shortest Path Problem
Jie Wei, Hang Wei · 2011
Shortest path problem is a basic problem in the research of combinatorial optimization. The transportation network is time-varying and stochastic affected by traffic, weather and other factors. The paper built a model for stochastic time-varying shortest path problem and proposed an algorithm to solve this problem. After discussing the complexity of the algorithm, and a case study is given.