吉林大学学报(工学版) ›› 2016, Vol. 46 ›› Issue (2): 412-417.doi: 10.13229/j.cnki.jdxbgxb201602012

• 论文 • 上一篇    下一篇

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

潘义勇1, 马健霄1, 孙璐2   

  1. 1.南京林业大学 汽车与交通工程学院,南京 210037;
    2.美国Catholic大学 土木工程系,美国 华盛顿特区 20064
  • 收稿日期:2014-02-12 出版日期:2016-02-20 发布日期:2016-02-20
  • 通讯作者: 马健霄(1966-),男,教授,博士生导师.研究方向:交通管理与控制.E-mail:majx@njfu.edu.cn E-mail:uoupanyg@163.com
  • 作者简介:潘义勇(1980-),男,讲师,博士.研究方向:交通管理与控制.E-mail:uoupanyg@163.com
  • 基金资助:
    国家自然科学基金重点项目(U1134206); 国家自然科学基金青年科学基金项目(51508280); 交通运输部西部项目(0901005C); 江苏省自然科学基金创新学者攀登计划项目(SBK200910046)

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

PAN Yi-yong1, MA Jian-xiao1, SUN Lu2   

  1. 1.College of Automobile and Traffic Engineering, Nanjing Forestry University, Nanjing 210037,China;
    2.Department of Civil Engineering,The Catholic University of America,Washington DC 20064,USA
  • Received:2014-02-12 Online:2016-02-20 Published:2016-02-20

摘要: 为了反映交通网络中考虑可靠性的路径选择行为,基于可靠性理论建立了动态随机网络环境下自适应最可靠路径模型.首先,定义行程时间可靠度为路径的目标函数,建立动态随机网络自适应最可靠路径模型反映交通网络的耗时随机特性,时变特性和风险性;其次,通过最优化理论把该问题转化为动态规划问题;然后,构造动态规划算法求解该问题;最后,通过Matlab计算机语言实现了算法程序,并针对实际交通网络展开数值试验.计算结果显示了该算法的收敛性和可行性.

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

Abstract: 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.

Key words: engineering of communications and transportation, intelligent transportation, stochastic and dynamic network, adaptive path, reliability, dynamic programming

中图分类号: 

  • U491
[1] 黄卫,张宁. 智能交通系统理论研究与实践[M]. 南京:江苏科学技术出版社,2011.
[2] 杨兆升. 城市交通流诱导系统理论与模型[M]. 北京:人民交通出版社, 2000.
[3] Schrank D, Lomax T. The 2012 annual urban mobility report[R]. Texas: Texas Transportation Institute, The Texas A&M University, 2012.
[4] Hall R W. The fastest path through a network with random time-dependent travel times[J]. Transportation Science, 1986, 20(3): 182-188.
[5] Miller-Hooks E D. Optimal routing in time-varying, stochastic networks: algorithms and implementations[D]. Austin:The University of Texas at Austin, 1997.
[6] Miller-Hooks E. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks[J]. Networks, 2001, 37(1): 35-52.
[7] Bander J L, White C C. A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost[J]. Transportation Science, 2002, 36(2): 218-230.
[8] Gao S, Chabini I. Optimal routing policy problems in stochastic time-dependent networks[J]. Transportation Research Part B: Methodological, 2006, 40(2): 93-122.
[9] Gao S, Huang H. Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks[J]. Transportation Research Part C: Emerging Technologies, 2012, 21(1): 196-213.
[10] Huang H, Gao S. Optimal paths in dynamic networks with dependent random link travel times[J]. Transportation Research Part B: Methodological, 2012, 46(5): 579-598.
[11] Wu X, Nie Y. Modeling heterogeneous risk-taking behavior in route choice: a stochastic dominance approach[J]. Transportation Research Part A, 2011, 45:896-915.
[12] Chen B Y, Lam W H K, Sumalee A, et al. Finding reliable shortest paths in road networks under uncertainty[J]. Networks and Spatial Economics, 2013, 13(2): 123-148.
[13] Chen B Y, Lam W H K, Sumalee A, et al. Reliable shortest path finding in stochastic networks with spatial correlated link travel times[J]. International Journal of Geographical Information Science, 2012, 26(2): 365-386.
[14] Ramaekers K, Reumers S, Wets G, et al. Modelling route choice decisions of car travellers using combined GPS and diary data[J]. Networks and Spatial Economics, 2013, 13(3): 351-372.
[15] Yao B, Hu P, Lu X, et al. Transit network design based on travel time reliability[J]. Transportation Research Part C: Emerging Technologies, 2014,in Press.
[16] 张志华.可靠性理论及工程应用[M]. 北京: 科学出版社, 2012.
[17] 潘义勇,孙璐.随机交通网络环境下自适应最可靠路径问题[J].吉林大学学报:工学版,2014,44(6):1622-1627.
Pan Yi-yong,Sun Lu.Adaptive reliable shortest path problem in stochastic traffic net work[J].Journal of Jilin University(Engineering and Technology Edition),2014,44(6):1622-1627.
[18] 党耀国,朱建军,李帮义,等.运筹学[M]. 北京: 科学出版社, 2012.
[1] 席利贺,张欣,孙传扬,王泽兴,姜涛. 增程式电动汽车自适应能量管理策略[J]. 吉林大学学报(工学版), 2018, 48(6): 1636-1644.
[2] 赵宏伟, 刘宇琦, 董立岩, 王玉, 刘陪. 智能交通混合动态路径优化算法[J]. 吉林大学学报(工学版), 2018, 48(4): 1214-1223.
[3] 徐洪峰, 高霜霜, 郑启明, 章琨. 信号控制交叉口的复合动态车道管理方法[J]. 吉林大学学报(工学版), 2018, 48(2): 430-439.
[4] 周炳海, 徐佳惠, 彭涛. 基于新型线边集成超市的周期性物料配送优化[J]. 吉林大学学报(工学版), 2018, 48(2): 588-595.
[5] 于繁华, 刘仁云, 张义民, 张晓丽, 孙秋成. 机械零部件动态可靠性稳健优化设计的群智能算法[J]. 吉林大学学报(工学版), 2017, 47(6): 1903-1908.
[6] 王海玮, 温惠英, 刘敏. 夜间环境驾驶员精神负荷的生理特性评估与实验[J]. 吉林大学学报(工学版), 2017, 47(2): 420-428.
[7] 宋传学, 周放, 肖峰. 基于动态规划的复合电源能量管理优化[J]. 吉林大学学报(工学版), 2017, 47(1): 8-14.
[8] 吴娇蓉, 王宇沁, 魏明, 林彬. 路侧公交专用道设置长度对公交线路运行可靠性的影响[J]. 吉林大学学报(工学版), 2017, 47(1): 82-91.
[9] 张英芝, 刘津彤, 申桂香, 戚晓艳, 龙哲. 基于故障相关性分析的数控机床系统可靠性建模[J]. 吉林大学学报(工学版), 2017, 47(1): 169-173.
[10] 孟广伟, 冯昕宇, 周立明, 李锋. 基于降维算法的结构可靠性分析[J]. 吉林大学学报(工学版), 2017, 47(1): 174-179.
[11] 赵丁选, 王倩, 张祝新. 基于层次分析法的可拓学理论对舰载直升机可靠性的评估[J]. 吉林大学学报(工学版), 2016, 46(5): 1528-1531.
[12] 姜桂艳, 刘彬, 隋晓艳, 马明芳. 基于IC卡收费系统的公交客流信息实时采集方法[J]. 吉林大学学报(工学版), 2016, 46(4): 1076-1082.
[13] 于繁华, 刘仁云, 张义民, 孙秋成, 张晓丽. 机械结构动态可靠性设计的智能计算方法[J]. 吉林大学学报(工学版), 2016, 46(4): 1269-1275.
[14] 宗芳, 王占中, 贾洪飞, 焦玉玲, 吴杨. 基于支持向量机的通勤日活动-出行持续时间预测[J]. 吉林大学学报(工学版), 2016, 46(2): 406-411.
[15] 李世武, 徐艺, 孙文财, 王琳虹, 郭梦竹, 柴萌. 基于瞳孔直径的撞固定物冲突自反馈识别方法[J]. 吉林大学学报(工学版), 2016, 46(2): 418-425.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!