Adaptive reliable shortest path problem in stochastic traffic network

作者：Pan Yi Yong; Sun Lu^*

来源：Journal of Jilin University (Engineering and Technology Edition), 2014, 44(6): 1622-1627.

DOI：10.13229/j.cnki.jdxbgxb201406014

• Bellman's principle
• Intelligent transportation
• Shortest path
• Shortest path problem
• Stochastic characteristic
• Stochastic networks
• Successive approximations
• Transportation network

In order to analyze the problem of selecting optimal path in traffic network, adaptive reliable shortest path problem is addressed in stochastic network. First, the mathematical model of stochastic traffic network is established to reflect the stochastic characteristic of traffic time in traffic network. Second, the optimal-reliable routing policy and optimal-reliable state chain based on reliability theory are uniformly defined in stochastic network;and the optimal-reliable state chain satisfies Bellman's principle that is the core of dynamic programming. Third, a successive approximation algorithm based on the dynamic programming is developed to solve the adaptive reliable shortest path problem in stochastic network, whose complexity is polynomial time. Finally, a computer program using Matlab language is developed to compute on the Sioux-Falls (SF) network. Numerical results in typical transportation network show the validity and feasibility of the successive approximation algorithm.

• 出版日期2014
• 单位东南大学; 南京林业大学