An outer approximation algorithm for the robust shortest path problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 58, Issue , 2013, Pages 52-66

  Shahabi, Mehrdad ^a   Unnikrishnan, Avinash ^a   Boyles, Stephen D ^b  

^a West Virginia University   (United States)

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

Author keywords

Mean standard deviation objective; Outer approximation; Robust shortest path

Indexed keywords

APPROXIMATION ALGORITHMS; COSTS; GRAPH THEORY; QUADRATIC PROGRAMMING; STATISTICS; STOCHASTIC SYSTEMS;

LINK COST; MEAN - STANDARD DEVIATION OBJECTIVE; MEAN STANDARD DEVIATION; OUTER APPROXIMATION; OUTER APPROXIMATION ALGORITHM; ROBUST SHORT PATH; SHORT-PATH; SHORTEST PATH PROBLEM; STOCHASTIC SHORTEST PATH PROBLEM; WEIGHTED SUM;

INTEGER PROGRAMMING;

ALGORITHM; NUMERICAL METHOD; STOCHASTICITY;

EID: 84881089864     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2013.07.002     Document Type: Article

References (37)

1. Alizadeh F., Goldfarb D. Second-order cone programming. Mathematical Programming 2003, 95(1):3-51.
2. Avineri E., Prashker J.N. Sensitivity to uncertainty: need for a paradigm shift. Transportation Research Record 2003, 1854:90-98.
3. Bar-Gera, H., Transportation Network Test Problems. < (accessed December 2012). http://www.bgu.ac.il/~bargera/tntp/.
4. Bates J., Polak J., Jones P., Cook A. The valuation of reliability for personal travel. Transportation Research Part E 2001, 37(2-3):191-229.
5. Ben-Tal A., Nemirovski A. Lectures on Modern Convex Optimization: Analysis Algorithms and Engineering Applications 2001, vol. 2. MPS/SIAM Series on Optimization SIAM, Philadelphia, PA.
6. Bonami, P., Kilinç, M., Linderoth, J., 2009. Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Technical Report # 1664. <. http://www.optimization-online.org/DB_FILE/2009/10/2429.pdf.
7. Boyles S.D., Waller S.T. A mean-variance model for the minimum cost flow problem with stochastic arc costs. Networks 2010, 56(3):215-227.
8. De Palma A., Picard N. Route choice decision under travel time uncertainty. Transportation Research Part A 2005, 39:295-324.
9. Duran M.A., Grossmann I.E. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming 1986, 36(307-339):339.
10. Eiger A., Mirchandani P.B., Soroush H. Path preferences and optimal paths in probabilistic networks. Transportation Science 1985, 19(1):75-84.
11. Fan Y., Nie Y. Optimal routing for maximizing the travel time reliability. Networks and Spatial Economics 2006, 3(6):333-344.
12. Fan Y., Kalaba R., Moore J. Arriving on time. Journal of Optimization Theory and Applications 2005, 127(3):497-513.
13. Fletcher R., Leyffer S. Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming 1994, 66(3):327-349.
14. Frank H. Shortest paths in probabilistic graphs. Operations Research 1969, 17:583-599.
15. Fu L., Rilett L.R. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research Part B 1998, 32(7):499-516.
16. Gao, S., 2005. Optimal Adaptive Routing and Traffic Assignment in Stochastic Time-dependent Networks. PhD Thesis. Massachusetts Institute of Technology, Cambridge, MA.
17. Hall R. The fastest path through a network with random time dependent travel times. Transportation Science 1986, 20:182-188.
18. Hardin, J., Garcia, S.R., Golan, D., 2012. A Method for Generating Realistic Correlation Matrices. ArXiv, Preprint arXiv:1106.5834.
19. Hutson K., Shier D. Extended dominance and a stochastic shortest path problem. Computers & Operations Research 2009, 36:584-596.
20. Kahneman D., Tversky A. Prospect theory: an analysis of decision under risk. Econometrica 1979, 47(2):263-291.
21. Liu H.X., Recker W., Chen A. Uncovering the contribution of travel time reliability to dynamic route choice using real-time loop data. Transportation Research Part A 2004, 38(6):435-453.
22. Lobo M.S., Vandenberghe L., Boyd S., Lebret H. Applications of second-order cone programming. Linear Algebra and its Applications 1998, 284(1-3):193-228.
23. Loui R.P. Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM 1983, 26:670-676.
24. Miller-Hooks E.D., Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 2000, 34(2):198-215.
25. Miller-Hooks E.D., Mahmassani H.S. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. European Journal of Operational Research 2003, 146(2):67-82.
26. Mirchandani P.B. Shortest distance and reliability of probabilistic networks. Computers and Operations Research 1976, 3(4):347-355.
27. Murthy I., Sarkar S. A relaxation-based pruning technique for a class of stochastic shortest path problems. Transportation Science 1996, 30(3):220-236.
28. Nie Y., Fan Y. Arriving-on-time problem: discrete algorithm that ensures convergence. Transportation Research Record 2006, 1964:193-200.
29. Nie Y., Wu X. Shortest path problem considering on-time arrival probability. Transportation Research Part B 2009, 43:597-613.
30. Nie Y., Wu X., Homem-de-Mello T. Optimal path problems with second-order stochastic dominance constraints. Networks and Spatial Economics 2012, 12:561-587.
31. Noland R.B., Polak J.W. Travel time variability: a review of theoretical and empirical issues. Transport Reviews 2002, 22(1):39-54.
32. Pinjari A.R., Bhat C.R. On the nonlinearity of response to level of service variables in travel mode choice models. Transportation Research Record 2006, 1977:67-74.
33. Sen S., Pillai R., Joshi S., Rathi A. A mean-variance model for route guidance in advanced traveler information systems. Transportation Science 2001, 35(1):37-49.
34. Sigal C.E., Prisker A., Solberg J.J. The stochastic shortest route problem. Operations Research 1980, 28:1122-1129.
35. Sivakumar R., Batta R. The variance-constrained shortest path problem. Transportation Science 1994, 28(4):309-316.
36. Small K.A., Winston C., Yan J. Uncovering the distribution of motorists' preferences for travel time and reliability. Econometrica 2005, 73:1367-1382.
37. Xing T., Zhou X. Finding the most reliable path with and without link travel time correlation: a Lagrangian substitution based approach. Transportation Research Part B 2011, 48(10):1660-1679.