Optimal paths planning in dynamic transportation networks with random link travel times

作     者：孙世超 段征宇 杨东援 SUN Shi-chao;DUAN Zheng-yu;YANG Dong-yuan

作者机构：Key Laboratory of Road and Traffic Engineering of the Ministry of Education (Tongji University) 

出 版 物：《Journal of Central South University》 (中南大学学报（英文版）)

年 卷 期：2014年第21卷第4期

页      面：1616-1623页

核心收录：

学科分类：0810[工学-信息与通信工程] 0806[工学-冶金工程] 08[工学] 082303[工学-交通运输规划与管理] 0805[工学-材料科学与工程（可授工学、理学学位）] 0703[理学-化学] 082302[工学-交通信息工程及控制] 0812[工学-计算机科学与技术（可授工学、理学学位）] 0823[工学-交通运输工程] 

基　　金：Project(71001079)supported by the National Natural Science Foundation of China 

主　　题：动态交通网络 最优路径规划 路段行程时间 旅行时间 随机性 时间依赖性 稳健优化 STD 

摘      要：A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.