[1] 肖增敏.动态网络车辆路径问题研究[D].西南交通大 学,2005,1(1):2-3. [XIAO Z M. Study on vehicle routing problem in dynamic network [D]. Southwest Jiaotong University, 2005, 1(1):2-3.] [2] Miller- Hooks E. Optimal routing in time- varying,stochastic networks:Algorithm and implementation[D]. Austin:Department of Civil Engineering,University of Texas at Austin,1997.
[3] 魏航,魏洁.随机时变网络下的应急路径选择研究[J].系统工程学报,2009,24(1): 99-103. [WEI H,WEI J.Emergency path problem in stochastic and time-varying network [J]. Journal of Systems Engineering, 2009, 24(1): 99-103.]
[4] 袁二明,蔡小强,涂奉生. 基于时间窗的随机时变交通网络信号相位协调[J].计算机工程,2008,34(5):17-19.[YUAN E M,CAI X Q,TU F S. Optimal offsets between intersections in stochastic time-varying traffic network based on time- windows [J]. Computer Engineering,2008, 34(5):17-19.]
[5] 安军.鲁棒性分析的方法论意义[J].科学技术哲学研究,2011,28(5):26- 30. [AN J. The methodological significance of robustness analysis [J].Journal of Philosophy of Science and Technology Research, 2011,28(5):26-30.]
[6] Michael P Wellman, Matthew Ford ,Kenneth Larson.Path planning under time- dependent uncertainty [C]//Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI- 95) ,Montreal, Quebec,Canada, 1995:532-539.
[7] Shichao Sun, Zhengyu Duan, Dongyuan Yang. Min-max regret approach to the optimal path finding problem in stochastic time- dependent networks [C]// Proceedings of 2013 IEEE ELEVENTH International Symposium on Autonomous Decentralized Systems (ISADS), Mexico,2013: 258-263.
[8] 段征宇.基于动态交通信息的车辆路径规划问题研究[D].同济大学,2009,4(2):50-59. [DUAN Z Y. Research of the vehicle path planning problem based on dynamic traffic information [D]. Tongji University, 2009, 4(2):50-59.] |