Optimal Path Problems with Second-Order Stochastic Dominance Constraints

Networks and Spatial Economics

Volumn 12, Issue 4, 2012, Pages 561-587

  Nie, Yu Marco ^a   Wu, Xing ^a   Homem de Mello, Tito ^b  

^a Northwestern University   (United States)

^b 1120 Science and Engineering Offices   (United States)

Author keywords

Dynamic programming; Integer programming; Optimal path problem; Stochastic dominance

Indexed keywords

EARLY ARRIVAL; FINITE NUMBER; INTEGER PROGRAM; LARGE-SCALE PROBLEM; LINEAR CONSTRAINTS; NUMERICAL EXPERIMENTS; OPTIMAL PATHS; STOCHASTIC DOMINANCE;

INTEGER PROGRAMMING; OPTIMIZATION; TRAFFIC CONTROL; TRAVEL TIME;

DYNAMIC PROGRAMMING;

EID: 84871150512     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-011-9167-6     Document Type: Article

References (47)

1. Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Netw Spat Econ 6(3-4): 293-311.
2. Arrow K (1965) Aspects of the theory of risk-bearing. Yrjö Hahnsson Foundation, Helsinki.
3. Arrow KJ (1971) Essays in the theory of risk bearing. Markham, chap Theory of risk aversion.
4. Bell MGH (2006) Mixed route strategies for the risk-averse shipment of hazardous materials. Netw Spat Econ 6(3-4): 253-265.
5. Bell MG, Cassir C (2002) Risk-averse user equilibrium traffic assignment: an application of game theory. Transp Res Part B 36: 671-681.
6. Bertsimas D, Sim M (2003) Robust discrete optimization and network flow. Math Prog B 98: 49-71.
7. Carraway RL, Morin TL, Moskowitz H (1990) Generalized dynamic programming for multicriteria optimization. Eur J Oper Res 44: 95-104.
8. Cootner P (1964) The random character of stock market prices. MIT Press, Cambridge, Massachusetts.
9. Current JR, ReVelle CS, Cohon J (1985) The maximum covering/shortest path problem: a multiobjective network design and routing formulation. Eur J Oper Res 21: 189-199.
10. Dentcheva D, Ruszczynski A (2003) Optimization with stochastic dominance constraints. SIAM J Optim 14(2): 548-566.
11. Dentcheva D, Ruszczynski A (2004) Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints. Math Program 99: 329-350.
12. Eiger A, Mirchandani PB, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transp Sci 19(1): 75-84.
13. Fan Y, Nie, Y (2006) Optimal routing for maximizing the travel time reliability. Netw Spat Econ 6(3-4): 333-344.
14. Fourer R, Gay DM, Kernighan BW (2003) AMPL: a modelling language for mathematical programming, 2nd edn. Duxbury Press.
15. Frank H (1969) Shortest paths in probabilistic graphs. Oper Res 17(4): 583-599.
16. Friedman M, Savage L (1948) The utility analysis of choices involving risk. J Polit Econ 56: 279-304.
17. Hadar J, Russell WR (1971) Stochastic dominance and diversification. J Econ Theory 3: 288-305.
18. Hanoch G, Levy H (1969) The efficiency analysis of choices involving risk. Rev Econ Stud 36: 335-346.
19. Homem-de-Mello T, Mehrotra S (2009) A cutting surface method for uncertain linear programs with polyhedral stochastic dominance constraints. SIAM J Optim 20: 1250-1273.
20. Hu J, Homem-de-Mello T, Mehrotra S (2009) Sample average approximation for stochastic dominance constrained problems. Manuscript, Northwestern University.
21. Hu J, Homem-de-Mello T, Mehrotra S (2010) Multi-criterion robust and stochastic dominance-constrained models with application to budget allocation in homeland security. Manuscript, available at http://www. optimization-online. org/DB_HTML/2010/04/2605. html.
22. Levy H (1992) Stochastic dominance and expected utility: survey and analysis. Manage Sci 38: 555-592.
23. Li R, Rose G, Sarvi M (2006) Using automatic vehicle identification data to gain insight into travel time variability and its causes. Transp Res Rec 1945: 24-32.
24. Linderoth JT, Shapiro A, Wright SJ (2006) The empirical behavior of sampling methods for stochastic programming. Ann Oper Res 142(1): 215-241.
25. Loui RP (1983) Optimal paths in graphs with stochastic or multidimensional weights. Commun ACM 26(9): 670-676.
26. Markowitz H (1952) Portfolio selection. J Finance 7: 77-91.
27. Markowitz H (1970) Portfolio selection: efficient diversification of investments. Wiley.
28. Masin M, Bukchin Y (2008) Diversity maximization approach for multiobjective optimization. Oper Res 56(2): 411-424.
29. Miller-Hooks E (1997) Optimal routing in time-varying, stochastic networks: algorithms and implementations. PhD thesis, Department of Civil Engineering, University of Texas at Austin.
30. Miller-Hooks E, Mahmassani H (1998) On the generation of nondominated paths in stochastic, time-varying networks. In: Proceedings of TRISTAN III (Triennial Symposium on Transportation Analysis), San Juan.
31. Miller-Hooks ED, Mahmassani HS (2000) Least expected time paths in stochastic, time-varying transportation networks. Transp Sci 34(2): 198-215.
32. Miller-Hooks ED, Mahmassani HS (2003) Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. Eur J Oper Res 146(2): 67-82.
33. Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3(4): 347-355.
34. Muller A, Stoyan D (2002) Comparison methods for stochastic models and risks. Wiley, Chichester, UK.
35. Murthy I, Sarkar S (1996) A relaxation-based pruning technique for a class of stochastic shortest path problems. Transp Sci 30(3): 220-236.
36. Nie Y, Wu X (2009a) Reliable a priori shortest path problem with limited spatial and temporal dependencies. In: Proceedings of the 18th international symposium on transportation and traffic theory, pp 169-196.
37. Nie Y, Wu X (2009b) Shortest path problem considering on-time arrival probability. Transp Res Part B 43: 597-613.
38. Roman D, Darby-Dowman K, Mitra G (2006) Portfolio construction based on stochastic dominance and target return distributions. Math Program 108: 541-569.
39. Rothschild M, Stiglitz JE (1970) Increasing risk. I. a definition. J Econ Theory 2: 225-243.
40. Samuelson P (1970) The fundamental approximation theorem of portfolio analysis in terms of means, variances and higher moments. Rev Econ Stud 37: 537-542.
41. Sen S, Pillai R, Joshi S, Rathi A (2001) A mean-variance model for route guidance in advanced traveler information systems. Transp Sci 35(1): 37-49.
42. Shapiro A, Homem-de-Mello T, Kim JC (2002) Conditioning of convex piecewise linear stochastic programs. Math Program 94: 1-19.
43. Sivakumar R, Batta R (1994) The variance-constrained shortest path problem. Transp Sci 28(4): 309-316.
44. Vickrey WS (1969) Congestion theory and transport investment. Amer Econ Rev 59: 251-261.
45. Whitmore GA (1970) Third degree stochastic dominance. Am Econ Rev 60: 457-459.
46. Wu X, Nie Y (2011). Modeling heterogeneous risk-taking behavior in route choice: a stochastic dominance approach. Transp Res Part A 45: 896-915.
47. Yu G, Yang J (1998) On the robust shortest path problem. Comput Oper Res 25(6): 457-468.