System-optimal stochastic transportation network design

Transportation Research Record

Volumn , Issue 2029, 2007, Pages 80-86

  Patil, Gopal R ^a   Ukkusuri, Satish V ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SYSTEMS; STOCHASTIC CONTROL SYSTEMS;

NETWORK DESIGN PROBLEM (NDP); TRANSPORTATION ENGINEERING;

TRANSPORTATION;

EID: 42149149929     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2029-09     Document Type: Article

References (23)

1. LeBlanc, L. J. An Algorithm for the Discrete Network Design Problem. Transportation Science, Vol. 9, 1975, pp. 183-199.
2. Abdulaal, M., and L. J. LeBlanc. Continuous Equilibrium Network Design Models. Transportation Research B, Vol. 13, 1979, pp. 19-32.
3. Friesz, T. L., H. J. Cho, N. J. Mehta, R. L. Tobin, and G. Anandalingham. A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Transportation Science, Vol. 26, 1992, pp. 18-26.
4. Marcotte, P., and G. Marquis. Efficient Implementation of Heuristic for the Continuous Network Design Problems. Annals of Operations Research, Vol. 34, 1992, pp. 163-176.
5. Meng, Q., H. Yang, and M. G. H. Bell. An Equivalent Continuously Differentiable Model and a Locally Convergent Algorithm for the Continuous Network Design Problem. Transportation Research B, Vol. 35, 2001, pp. 83-105.
6. Suwansirikul, C., T. L. Friesz, and R. L. Tobin. Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem. Transportation Science, Vol. 21, 1987, pp. 254-263.
7. Ukkusuri, S. Accounting for Uncertainty, Robustness and Online Information in Transportation Networks. PhD thesis. University of Texas, Austin, 2005.
8. Waller, T. S., and A. K. Ziliaskopoulos. Stochastic Dynamic Network Design Problem. In Transportation Research Record: Journal of the Transportation Research Board, No. 1771, TRB, National Research Council, Washington, D.C., 2001, pp. 106-113.
9. Flyvbjerg, B., M. K. S. Holm, and S. L. Buhl. How (In)Accurate are Demand Forecasts in Public Works Projects? The Case of Transportation. Journal of the American Planning Association, Vol. 71, No. 2, 2005, pp. 131-146.
10. LeBlanc, L. J., and M. Abdulaal. A Comparison of User Optimum Versus System Optimum Traffic Assignment in Transportation Network Design. Transportation Research B, Vol. 18, No.2, 1984, pp. 115-121.
11. Dantzig, G. B., and S. F. Maier. Formulating and Solving the Network Design Problem by Decomposition. Transportation Research B, Vol. 13, 1979, pp. 5-17.
12. Chen, M., and A. S. Alfa. A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach. Transportation Science, Vol. 25, 1991, pp. 215-224.
13. Gao, Z., J. Wu, and H. Sun. Solution Algorithm for the Bilevel Discrete Network Design Problem. Transportation Research B, Vol. 39, 2005, pp. 479-495.
14. Magnanti, T. L., and R. T. Wong. Network Design and Transportation Planning: Models and Algorithms. Transportation Science, Vol. 18, 1984, pp. 1-55.
15. Yang, H., and M. G. H. Bell. Models and Algorithms for Road Network Design: A Review and Some New Developments. Transport Review, Vol. 18, 1998, pp. 257-278.
16. Ukkusuri, S. V., A. Karoonsoontawong, and S. T. A. Waller. Stochastic Dynamic User Optimal Network Design Model Accounting for Demand Uncertainty. In International Conference on Transportation Systems Planning and Operations (TRANSPO2004). HT Madras, Chennai, India, 2004.
17. Riis, M., and K. A. Anderson. Capacited Network Design with Uncertain Demand. INFORMS Journal of Computing, Vol. 14, No. 3, 2002, pp. 247-260.
18. Andrade, R., A. Lisser, N. Maculan, and G. Plateau. B and B Framework for the Capacity Expansion of High Speed Telecommunication Network Under Uncertainty. Annals of Operations Research, Vol. 140, 2005, pp. 49-65.
19. Cole Smith, J., A. J. Schaefer, and J. W. Yen. A Stochastic Integer Programming Approach to Solving a Synchronous Optical Network Ring Design Problem. Networks, Vol. 44, No. 1, 2004, pp. 12-26.
20. Ahmed, S., and N. V. Sahinidis. An Approximate Scheme for Stochastic Integer Programs Arising in Capacity Expansion. Operations Research, Vol. 51, No. 3, 2003, pp. 461-471.
21. Waltz, R. A., and T. Plantenga. KNITRO 5.0 User's Manual. Ziena Optimization, Inc., Evanston, Ill., 2006.
22. Czyzyk, J., M. Mesnier, and J. Mor. The NEOS Server. IEEE Journal on Computational Science and Engineering, Vol. 5, 1998, pp. 68-75.
23. Kail, P., and S. W. Wallace. Stochastic Programming, 2nd ed. John Wiley and Sons, New York, 1994.