[1] GAO S, CHABINI I. Optimal routing policy problems in stochastic time- dependent networks[J]. Transportation Research Part B: Methodological, 2006, 40(2): 93-122.
[2] WU X, NIE Y M. Modeling heterogeneous risk- taking behavior in route choice: A stochastic dominance approach[J]. Transportation Research Part A, 2011(45): 896-915.
[3] KHANI A, BOYLES S D. An exact algorithm for the mean- standard deviation shortest path problem[J]. Transportation Research Part B: Methodological, 2015 (81): 252-266.
[4] WANG L, YANG L, GAO Z. The constrained shortest path problem with stochastic correlated link travel times[J]. European Journal of Operational Research, 2016, 255(1): 43-57.
[5] 潘义勇, 马健霄. 基于可靠性的随机交通网络约束最优路径问题研究[J]. 东南大学学报(自科版), 2017(6): 1263- 1268. [PAN Y Y, MA J X. The constrained shortest path problem in stochastic traffic network based on the reliability[J]. Journal of Southeast University (Natural Science Edition), 2017(6): 1263-1268.]
[6] 潘义勇, 马健霄, 孙璐. 基于可靠度的动态随机交通网络耗时最优路径[J]. 吉林大学学报(工学版), 2016, 46 (2): 412-417. [PAN Y Y, MA J X, SUN L. Optimal path in dynamic network with random link travel times based on reliability[J]. Journal of Jilin University (Engineering and Technology Edition), 2016, 46(2): 412-417. ]
[7] XING T, ZHOU X. Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach[J]. Transportation Research Part B: Methodological, 2011, 45(10): 1660-1679. |