Robust transportation network design under demand uncertainty

Computer-Aided Civil and Infrastructure Engineering

Volumn 22, Issue 1, 2007, Pages 6-18

  Ukkusuri, Satish V ^a   Mathew, Tom V ^b   Waller, S Travis ^c  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES;

OPTIMAL NETWORK DESIGN; ROBUST TRANSPORTATION NETWORK; TRAFFIC NETWORK DESIGN PROBLEM; TRANSPORTATION PLANNING;

COMPUTER AIDED DESIGN;

COMPUTER AIDED DESIGN; GENETIC ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES;

GENETIC ALGORITHM; NETWORK DESIGN; NUMERICAL MODEL; OPTIMIZATION; PROBABILITY; TRANSPORTATION SYSTEM; UNCERTAINTY ANALYSIS;

EID: 33750972613     PISSN: 10939687     EISSN: 14678667     Source Type: Journal    
DOI: 10.1111/j.1467-8667.2006.00465.x     Document Type: Article

References (41)

1. Abdulaal, M. & LeBlanc, L. J. (1979), Continuous equilibrium network design models, Transportation Research, 13B, 19-32.
2. Atamturk, A. (2003), Strong formulations of robust mixed 0-1 programming, Technical Report BCOL.03.04, IEOR, University of California at Berkeley.
3. Atamturk, A. & Zhang, M. (2006), Two-stage robust network flow and design under demand uncertainty, Operations Research. Accepted for publication.
4. Chiou, S. (2005), Bilevel programming for the continuous transport network design problem, Transportation Research, 39B, 362-83.
5. Coello, C. A., Van Veldhuizen, D. A. & Lamont, G. B. (2002), Evolutionary Algorithms for Solving Multiobjective Problems, Kluwer, New York.
6. Dantzig, G. B., Harvey, R. P., Landsowne, Z. F., Robinson, D. W. & Maier, S. F. (1979), Formulating and solving the network design problem by decomposition, Transportation Research, 13B, 5-17.
7. Davis, G. A. (1994), Exact local solution of the continuous network design problem via stochastic user equilibrium assignment, Transportation Research, 28B, 61-75.
8. Deb, K. (2002), Multi-Objective Optimization Using Evolutionary Algorithms, Wiley, Chichester.
9. Drezner, Z. & Salhi, S. (2002), Using hybrid metaheuristics for the one-way and two-way network design problem, Naval Research Logistics, 49, 449-63.
10. Escudero, L. F., Kamesam, P. V., King, A., & Wets, R. J.-B. (1993), Production planning via scenario modeling, Annals of Operations Research, 43, 311-35.
11. Friesz, T., Cho, H., Mehta, N., Tobin, R. & Anandalingam, G. (1992), A simulated annealing approach to the network design problem with variational inequality constraints, Transportation Science, 26, 18-25.
12. Friesz, T. L., Anandalingam, G., Mehta, N. J., Nam, K., Shah, S. J. & Tobin, R. L. (1993), The multiobjective equilibrium network design problem revisited: A simulated annealing approach, European Journal of Operational Research, 65, 44-57.
13. Goldberg, D. E. (1989), Genetic Algorithm in Search, Optimization and Machine Learning, Addison-Wesley, Boston.
14. Gutierrez, G. J., & Kouvelis, P. (1995), A robustness approach to international sourcing, Annals of Operations Research, 59, 165-93.
15. Hanne, T. (2001), Selection and mutation strategies in evolutionary algorithms for global multiobjective optimization, Evolutionary Optimization, 3 (1), 27-40.
16. Harker, P. T. & Friesz, T. L. (1984), Bounding the solution of the continuous equilibrium network design problem, in Proceedings of the Ninth International Symposium on Transportation and Traffic Theory, 233-52.
17. Hoang, H. H. (1982), Topological optimization of networks: A non-linear mixed integer model employing generalized benders decomposition, IEEE Transactions on Automated Control, 27, 164-9.
18. LeBlanc, L. J. (1975), An algorithm for the discrete network design problem, Transportation Science, 9, 183-99.
19. LeBlanc, L. J. & Abdulaal, M. (1984), A comparison of user optimal and system optimal traffic assignment in transportation network design, Transportation Research B, 18 (2), 115-21.
20. List, G. F., Wood, B., Nozick, L. K., Turnquist, M. A., Jones, D. A., Kjeldgaard, E. A. & Lawton, C. R. (2003), Robust optimization for fleet planning under uncertainty, Transportation Research, Part E, 39 (3), 209-27.
21. Malcolm, S. A. & Zenios, S. A. (1994), Robust optimization for power systems capacity expansion under uncertainty, journal of Operations Research Society, 45 (9), 1040-9.
22. Markowitz, H. (1959), Portfolio selection, efficiency diversification of investments, Cowles Foundation Monograph 16, Yale University Press, New Haven, CT.
23. Michalewicz, Z. (1992), Genetic Algorithms + Data Structures = Evolution Programs, Springer Verlag, New York.
24. Mouskos, K. (1991), A taboo-search based approach for network design. Ph.D. dissertation, The University of Texas at Austin, Austin, TX.
25. Nguyen, S. & Dupius, C. (1984), An efficient method for computing traffic equilibria in networks with asymmetric transportation costs, Transportation Science, 18, 185-202.
26. Paraskevopoulos, D., Karakitsos, E. & Rustem, B. (1991), Robust capacity planning under uncertainty, Management Science, 37 (7), 787-800.
27. Poorzahedy, H. & Abulghasemi, F. (2005), Application of ant system to network design problem, Transportation, 32, 251-73.
28. Santoso, T., Ahmed, S., Goetschalckx, M. & Shapiro, A. (2005), A stochastic programming approach for supply chain network design under uncertainty, European Journal of Operational Research, 167, 96-115.
29. Sengupta, J. K. (1991), Robust solutions in stochastic linear programming, JORSA, 42 (10), 857-70.
30. Sheffi, Y. (1985), Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methoods, Prentice-Hall, Englewood Cliffs, NJ.
31. Steenbrink, P. A. (1974), Optimization of Transportation Networks, John Wiley & Sons, London.
32. Sumalee, A. & Watling, D. (2004). Reliable network design with stochastic demand. The Second International Conference on Transportation Network Reliability, Christchurch and Queenstown, New Zealand.
33. Suwansirikul, C., Friesz, T. L. & Tobin, R. L. (1987), Equilibrium decomposed optimization: A heuristic for the continuous equilibrium network design problem, Transportation Science, 21, 254-63.
34. Ukkusuri, S. (2005), Accounting for uncertainty, robustness and information recourse in transportation networks. Ph.D. dissertation, University of Texas, Austin.
35. Ukkusuri, S. & Waller, S. T. (2006), Single-point approximations for traffic equilibrium problem under uncertain demand, Transportation Research Record: Journal of the Transportation Research Board, No. 1964, Transportation Research Board of the National Academies, Washington, DC, pp. 169-75.
36. Ukkusuri, S., Karoonsoontawong, A. & Waller, S. T. (2004), A stochastic dynamic user optimal network design model, in Proceedings of the TRANSPO 2004 conference at IIT Madras.
37. Veldhuizen Van, D. A. & Lamont, G. B. (2000), On measuring multiobjective evolutionary algorithm performance, in IEEE Proceedings of the 2000 Congress on Evolutionary Computation, Piscataway, NJ, July, vol. 1, 204-11.
38. Waller, S. T. & Ziliaskopoulos, A. K. (2001), A dynamic and stochastic approach to network design, Journal of the Transportation Research Board No. 1771, 106-14.
39. Xiong, Y. & Schneider, J. B. (1995), Processing of constraints in transportation network design problem, Journal of Computing in Civil Engineering, 9 (1), 21-8.
40. Yang, H. & Bell, M. G. H. (1998), Models and algorithms for road network design: A review and some new development, Transport Review, 18 (3), 257-78.
41. Zitzler, E. (2005), Evolutionary algorithms for multiobjective optimization: Methods and applications, Swiss Federal Institute of Technology (ETH) Zurich. TIK-Schriftenreihe, X., 1999. Nr. 30. Doss ETH No. 13398, Shaker, Aachen.