An exact algorithm for the mean-standard deviation shortest path problem

Transportation Research Part B: Methodological

Volumn 81, Issue , 2014, Pages 252-266

  Khani, Alireza ^a   Boyles, Stephen D ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

Mean standard deviation; Non additive shortest path; Path efficient frontier; Reliability

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; GRAPH THEORY; LAGRANGE MULTIPLIERS; NUMERICAL METHODS; RELIABILITY; STATISTICS; TRAFFIC CONTROL; TRAVEL TIME;

EFFICIENT FRONTIER; LABELING ALGORITHMS; LAGRANGIAN RELAXATION; MEAN AND STANDARD DEVIATIONS; MEAN STANDARD DEVIATION; OUTER APPROXIMATION METHODS; SHORTEST PATH; SHORTEST PATH PROBLEM;

ITERATIVE METHODS;

FRONTIER REGION; GENETIC ALGORITHM; LAGRANGIAN ANALYSIS; NUMERICAL MODEL; TRANSPORTATION PLANNING; TRAVEL TIME;

EID: 84956629417     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2015.04.002     Document Type: Article

References (23)

1. Boyles, S.D., Waller, S.T., 2010. A mean-variance model for the minimum cost flow problem with stochastic arc costs. Networks 56 (3), 215-227.
2. Chen, P.W., Nie, Y.M., 2013. Bicriterion shortest path problem with a general nonadditive cost. Procedia-Social and Behavioral Sciences 80, 553-575.
3. Dial, R.B., 1979. A model and algorithm for multicriteria route-mode choice. Transportation Research Part B 13 (4), 311-316.
4. Dial, R.B., 1996. Bicriterion traffic assignment: basic theory and elementary algorithms. Transportation Science 30 (2), 93-111.
5. Dial, R.B., 1997. Bicriterion traffic assignment: efficient algorithms plus examples. Transportation Research Part B 31 (5), 357-379.
6. Fan, Y.Y., Kalaba, R.E., Moore II, J.E., 2005a. Arriving on time. Journal of Optimization Theory and Applications 127 (3), 497-513.
7. Fan, Y.Y., Kalaba, R.E., Moore II, J.E., 2005b. Shortest paths in stochastic networks with correlated link costs. Computers and Mathematics with Applications 49 (9), 1549-1564.
8. Hutson, K.R., Shier, D.R., 2009. Extended dominance and a stochastic shortest path problem. Computers & Operations Research 36 (2), 584-596.
9. Lo, H.K., Tung, Y.K., 2003. Network with degradable links: capacity analysis and design. Transportation Research Part B 37 (4), 345-363.
10. Mirchandani, P.B., Wiecek, M.M., 1993. Routing with nonlinear multiattribute cost functions. Applied Mathematics and Computation 54 (2), 215-239.
11. Nie, Y., Fan, Y., 2006. Arriving-on-time problem: discrete algorithm that ensures convergence. Transportation Research Record: Journal of the Transportation Research Board 1964 (1), 193-200.
12. Nie, Y.M., Wu, X., 2009. Shortest path problem considering on-time arrival probability. Transportation Research Part B 43 (6), 597-613.
13. Sen, S., Pillai, R., Joshi, S., Rathi, A.K., 2001. A mean-variance model for route guidance in advanced traveler information systems. Transportation Science 35 (1), 37-49.
14. Shahabi, M., Unnikrishnan, A., Boyles, S.D., 2013. An outer approximation algorithm for the robust shortest path problem. Transportation Research Part E: Logistics and Transportation Review 58, 52-66.
15. Shahabi, M., Unnikrishnan, A., Boyles, S.D., 2014. Robust optimization strategy for the shortest path problem under uncertain link travel cost distribution. Computer-Aided Civil and Infrastructure Engineering.
16. Srinivasan, K.K., Prakash, A.A., Seshadri, R., 2014. Finding most reliable paths on networks with correlated and shifted log-normal travel. Times 66, 110-128.
17. Tan, Z., Yang, H., Guo, R., 2014. Pareto efficiency of reliability-based traffic equilibria and risk-taking behavior of travelers. Transportation Research Part B 66, 16-31.
18. Transportation Test Problems.
19. Wang, J.Y., Ehrgott, M., Chen, A., (2014) A bi-objective user equilibrium model of travel time reliability in a road network. Transportation Research Part B 66, 4-15.
20. Xing, T., Zhou, X., 2011. Finding the most reliable path with and without link travel time correlation: a Lagrangian substitution based approach. Transportation Research Part B 45 (10), 1660-1679.
21. Yang, L., Zhuo, X., 2014. Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem. Transportation Research Part B 59, 22-44.
22. Zockaie, A., Nie, Y.M., Wu, X., Mahmassani, H.S., 2013. Impacts of correlations on reliable shortest path finding. Transportation Research Record: Journal of the Transportation Research Board 2334 (1), 1-9.
23. Zockaie, A., Nie, Y.M., Mahmassani, H.S., 2014. Plan B: a simulation-based method for finding minimum travel time budget paths in stochastic networks with correlated link times. In: Transportation Research Board 93rd Annual Meeting (No. 14-5615).