Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution

Computer-Aided Civil and Infrastructure Engineering

Volumn 30, Issue 6, 2015, Pages 433-448

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

^a West Virginia University   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DISTRIBUTION FUNCTIONS; GRAPH THEORY; QUADRATIC PROGRAMMING;

LARGE NETWORKS; NONLINEAR INTEGER PROGRAM; NUMERICAL EXPERIMENTS; OUTER APPROXIMATION ALGORITHM; QUADRATIC PROGRAMS; ROBUST OPTIMIZATION; SHORTEST PATH PROBLEM; SOLUTION ALGORITHMS;

INTEGER PROGRAMMING;

ALGORITHM; OPTIMIZATION; TRAVEL BEHAVIOR; UNCERTAINTY ANALYSIS;

EID: 84929149620     PISSN: 10939687     EISSN: 14678667     Source Type: Journal    
DOI: 10.1111/mice.12103     Document Type: Article

References (62)

1. Atamturk, A., Berenguer, G. & Shen, Z. J. M. (2012), A conic integer programming approach to stochastic joint location-inventory problems, Operations Research, 60(2), 366-81.
2. Bar-Gera, H. (2013), Transportation Network Test Problems. Available at: http://www.bgu.ac.il/{reversed tilde}bargera/tntp/, accessed July 2013.
3. Ben-Tal, A., El-Ghaoui, L. & Nemirovski, A. (2009), Robust Optimization, Princeton University Press, Princeton, NJ.
4. Ben-Tal, A. & Nemirovski, A. (1998), Robust convex optimization, Mathematics of Operations Research, 23(4), 769-805.
5. Ben-Tal, A. & Nemirovski, A. (1999), Robust solutions of uncertain linear programs, Operations Research Letters, 25(1), 1-13.
6. Ben-Tal, A. & Nemirovski, A. (2000), Robust solutions of linear programming problems contaminated with uncertain data, Mathematical Programming, 88, 411-24.
7. Bertsekas, D. P. (2005), Dynamic Programming & Optimal Control, vol. I, Athena Scientific, Cambridge, MA.
8. Bertsekas, D. P. (2007), Dynamic Programming & Optimal Control, vol. II, Athena Scientific, Cambridge, MA.
9. Bertsimas, D. & Sim, M. (2003), Robust discrete optimization and network flows, Mathematical Programming, 98(1-3), 49-71.
10. Bertsimas, D. & Sim, M. (2004), The price of robustness, Operations Research, 52(1), 35-53.
11. Beyer, H.-G. & Sendhoff, B. (2007), Robust optimization-a comprehensive survey, Computer Methods in Applied Mechanics and Engineering, 196(33-34), 3190-218.
12. Bonami, P., Biegler, L. T., Conn, A. R., Cornuéjols, G., Grossmann, I. E., Laird, C. D., Lee, J., Lodi, A., Margot, F., Sawaya, N. & Wächter, A. (2008), An algorithmic framework for convex mixed integer nonlinear programs, Discrete Optimization, 5, 186-204.
13. 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-27.
14. Chen, X., Sim, M. & Sun, P. (2007), A robust optimization perspective on stochastic programming. Operations Research, 55(6), 1058-71.
15. Cheung, R. K. (1998), Iterative methods for dynamic stochastic shortest path problems, Naval Research Logistics, 45, 769-89.
16. Duran, M. A. & Grossmann, I. E. (1986), An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Mathematical Programming, 36, 307-39.
17. Duthie, J. C., Unnikrishnan, A. & Waller, S. T. (2011), Influence of demand uncertainty and correlations on traffic predictions and decisions, Computer-Aided Civil and Infrastructure Engineering, 261, 16-29.
18. Eiger, A., Mirchandani, P. B. & Soroush, H. (1985), Path preferences and optimal paths in probabilistic networks, Transportation Science, 19(1), 75-84.
19. El-Ghaoui, L. & Lebret, H. (1997), Robust solutions to least-squares problems with uncertain data, SIAM Journal of Matrix Analysis and Applications, 18, 1035-64.
20. El-Ghaoui, L., Oustry, F. & Lebret, H. (1998), Robust solutions to uncertain semidefinite programs, SIAM Journal of Optimization, 9, 33-52.
21. Fan, Y., Kalaba, R. & Moore, J. (2005a), Arriving on time, Journal of Optimization Theory and Applications, 127(3), 497-513.
22. Fan, Y., Kalaba, R. & Moore, J. (2005b), Shortest paths in stochastic networks with correlated link costs, Computers and Mathematics with Applications, 49(9-10), 1549-64.
23. Fan, Y. & Nie, Y. (2006), Optimal routing for maximizing the travel time reliability, Networks and Spatial Economics, 3(6), 333-44.
24. Ferguson, E. M., Duthie, J. & Waller, S. T. (2012), Comparing delay minimization and emissions minimization in the network design problem, Computer-Aided Civil and Infrastructure Engineering, 274, 288-302.
25. Fletcher, R. & Leyffer, S. (1994), Solving mixed integer nonlinear programs by outer approximation, Mathematical Programming, 66(3), 327-49.
26. Frank, H. (1969), Shortest paths in probabilistic graphs, Operations Research, 17, 583-99.
27. Fu, L. & Rilett, L. R. (1998), Expected shortest paths in dynamic and stochastic traffic networks, Transportation Research Part B, 32(7), 499-516.
28. Gao, S. (2005), Optimal adaptive routing and traffic assignment in stochastic time-dependent networks. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.
29. Gao, S. & Chabini, I. (2006), Optimal routing policy problems in stochastic time-dependent networks, Transportation Research Part B, 40, 93-122.
30. Gulpinar, N., Pachamanavo, D. & Canakoglu, E. (2013), Robust strategies for facility location under uncertainty, European Journal of Operational Research, 225, 21-35.
31. Hajibabai, L. & Ouyang, Y. (2013), Integrated planning of supply chain networks and multimodal transportation infrastructure expansion: model development and application for the biofuel industry, Computer-Aided Civil and Infrastructure Engineering, 284, 247-59.
32. Hall, R. (1986), The fastest path through a network with random time dependent travel times, Transportation Science, 20, 182-88.
33. Hutson, K. & Shier, D. (2009), Extended dominance and a stochastic shortest path problem, Computers & Operations Research, 36, 584-96.
34. Iori, M., Martello, S. & Pretolani, D. (2010), An aggregate label setting policy for the multi-objective shortest path problem, European Journal of Operational Research, 207(3), 1489-96.
35. Jiang, X. & Adeli, H. (2003), Freeway work zone traffic delay and cost optimization model, Journal of Transportation Engineering, 129(3), 230-41.
36. Kang, Y., Batta, R. & Kwon, C. (2014a), Generalized route planning model for hazardous material transportation with VaR and equity considerations, Computers & Operations Research, 43, 237-47.
37. Kang, Y., Batta, R. & Kwon, C. (2014b), Value-at-risk model for hazardous material transportation, Annals of Operations Research, 222(1), 361-87.
38. Kouvelis, P. & Yu, G. (1997), Robust Discrete Optimization and Its Applications, Kluwer Academic Publishers, Norwell, MA.
39. Kwon, C., Lee, T. & Berglund, P. G. (2013), Robust shortest path problems with two uncertain multiplicative cost coefficient, Naval Research Logistics, 60(5), 375-94.
40. Loui, R. P. (1983), Optimal paths in graphs with stochastic or multidimensional weights, Communications of the ACM, 26, 670-76.
41. Miller-Hooks, E. D. (2001), Adaptive least-expected time paths in stochastic, time-varying transportation and data networks, Networks, 37(1), 35-52.
42. Miller-Hooks, E. D. & Mahmassani, H. S. (2000), Least expected time paths in stochastic, time-varying transportation networks, Transportation Science, 34(2), 198-215.
43. Mirchandani, P. B. (1976), Shortest distance and reliability of probabilistic networks, Computers and Operations Research, 3(4), 347-55.
44. Montemani, R. & Gambardella, L. (2004), An exact algorithm for the robust shortest path problem with interval data, Computers and Operations Research, 31, 1667-80.
45. Murthy, I. & Sarkar, S. (1996), A relaxation-based pruning technique for a class of stochastic shortest path problems, Transportation Science, 30(3), 220-36.
46. Ng, M. W. & Waller, S. T. (2012), A dynamic route choice model considering uncertain capacities, Computer-Aided Civil and Infrastructure Engineering, 27(4), 231-43.
47. Nie, Y., Wu, X. & Homem-de-Mello, T. (2012), Optimal path problems with second-order stochastic dominance constraints, Networks and Spatial Economics, 12, 561-87.
48. Papola, A. & Marzano, V. (2013), A network generalized extreme value model for route choice allowing implicit route enumeration, Computer-Aided Civil and Infrastructure Engineering, 28(8), 560-80.
49. Provan, J. S. (2003), A polynomial-time algorithm to find shortest paths with recourse, Networks, 41(2), 115-25.
50. Ramezani, M. & Geroliminis, N. (2012), On the estimation of arterial route travel time distribution with Markov chains, Transportation Research Part B, 46(10), 1576-90.
51. Reinhardt, L. B. & Pisinger, D. (2011), Multi-objective and multi-constrained non-additive shortest path problems, Computers & Operations Research, 38(3), 605-16.
52. Sen, S., Pillai, R., Joshi, S. & Rathi, A. (2001), A mean-variance model for route guidance in advanced traveler information systems, Transportation Science, 35(1), 37-49.
53. Shahabi, M., Unnikrishnan, A. & Boyles, S. D. (2013), An outer approximation algorithm for the robust shortest path problem, Transportation Research Part E, 58, 52-66.
54. Sigal, C. E., Prisker, A. & Solberg, J. J. (1980), The stochastic shortest route problem, Operations Research, 28, 1122-29.
55. Sivakumar, R. & Batta, R. (1994), The variance-constrained shortest path problem, Transportation Science, 28(4), 309-16.
56. Unnikrishnan, A. & Waller, S. T. (2009), User equilibrium with recourse, Networks and Spatial Economics, 9, 575-93.
57. Waller, S. T. & Ziliaskopoulos, A. K. (2002), On the online shortest path problem with limited arc cost dependencies, Networks, 40(4), 216-27.
58. Xie, C. & Waller, S. T. (2012), Optimal routing with multiple objectives: efficient algorithm and application to the hazardous materials transportation problem, Computer-Aided Civil and Infrastructure Engineering, 27(2), 77-94.
59. 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, 48(10), 1660-79.
60. Xing, T. & Zhou, X. (2013), Reformulation and solution algorithms for absolute and percentile robust shortest path problems, IEEE Transactions on Intelligent Transportation Systems, 14(2), 943-54.
61. Yang, L. & Zhou, 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.
62. Yu, G. & Yang, J. (1998), On the robust shortest path problem, Computers and Operations Research, 25, 457-68.