基于可靠度的动态随机交通网络耗时最优路径  

Optimal path in dynamic network with random link travel times based on reliability

作　　者：潘义勇[1] 马健霄[1] 孙璐 

机构地区：[1]南京林业大学汽车与交通工程学院,南京210037 [2]美国Catholic大学土木工程系,美国华盛顿特区20064

出　　处：《吉林大学学报（工学版）》2016年第2期412-417,共6页Journal of Jilin University:Engineering and Technology Edition

基　　金：国家自然科学基金重点项目(U1134206);国家自然科学基金青年科学基金项目(51508280);交通运输部西部项目(0901005C);江苏省自然科学基金创新学者攀登计划项目(SBK200910046)

摘　　要：为了反映交通网络中考虑可靠性的路径选择行为,基于可靠性理论建立了动态随机网络环境下自适应最可靠路径模型。首先,定义行程时间可靠度为路径的目标函数,建立动态随机网络自适应最可靠路径模型反映交通网络的耗时随机特性、时变特性和风险性;其次,通过最优化理论把该问题转化为动态规划问题;然后,构造动态规划算法求解该问题;最后,通过Matlab计算机语言实现了算法程序,并针对实际交通网络展开数值试验。计算结果显示了该算法的收敛性和可行性。In order to reflect the routing selection behavior considering reliability in essence,a mathematic model of optimal-reliable routing in stochastic and dynamic traffic network is developed based on reliability theory.First,through defining reliability as the objective function of routing,the adaptive reliable shortest path problem in stochastic and dynamic network is established to reflect the stochastic,time-varying and risk characteristics of travel time.Then,using optimization theory,the adaptive reliable shortest path problem is transformed the dynamic programming problem.Finally,an algorithm based on dynamic programming is developed to solve the proposed problem.Numerical results in typical transportation network demonstrate the validity and feasibility of the proposed algorithm.

关 键 词：交通运输工程 智能交通 动态随机网络 自适应路径 可靠性 动态规划 

分 类 号：U491[交通运输工程—交通运输规划与管理]