Robust approach to discrete network designs with demand uncertainty

Transportation Research Record

Volumn , Issue 2090, 2009, Pages 86-94

  Lou, Yingyan ^a   Yin, Yafeng ^a   Lawphongpanich, Siriphong ^a  

^a University of Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TRAFFIC CONTROL;

DEMAND UNCERTAINTY; DISCRETE NETWORK DESIGN PROBLEM; DISCRETE NETWORKS; NETWORK DESIGN; ORIGIN DESTINATION; ORIGIN-DESTINATION PAIRS; PROBABILITY OF OCCURRENCE; ROBUST APPROACHES; TRAVEL DEMAND; UNCERTAINTY;

PROBLEM SOLVING;

EID: 71049191339     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2090-10     Document Type: Article

References (42)

1. Boyce, D. E. Urban Transportation Network Equilibrium and Design Models: Recent Achievements and Future Prospective. Environment and Planning A, Vol.16, 1984, pp. 1445-1474.
2. Magnanti, T. L., and R. T. Wong. Network Design and Transportation Planning: Models and Algorithms. Transportation Science, Vol.18, 1984, pp. 1-55.
3. Friesz, T. L. Transportation Network Equilibrium, Design and Aggregation: Key Developments and Research Opportunities. Transportation Research A, Vol.19, pp. 413-427.
4. Bell, M. G. H., and Y. Iida. Transportation Network Analysis. John Wiley and Sons, West Sussex, England, 1997.
5. Yang, H., and M. G. H. Bell. Models and Algorithms for Road Network Design: A Review and Some New Development. Transportation Review, Vol.18, 1998, pp. 257-278.
6. 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.
7. Chiou, S. Bi-Level Programming for the Continuous Transport Network Design Problem. Transportation Research B, Vol.39, 2005, pp. 362-383.
8. Ban, X., H. X. Liu, J. Lu, and M. C. Ferris. Decomposition Scheme for Continuous Network Design Problem with Asymmetric User Equilibria. In Transportation Research Record: Journal of the Transportation Research Board, No.1964, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 185-192.
9. LeBlanc, L. J. An Algorithm for the Discrete Network Design Problem. Transportation Science, Vol.9, 1975, pp. 183-199.
10. Poorzahedy, H., and M. A. Turnquist. Approximate Algorithms for the Discrete Network Design Problem. Transportation Research B, Vol.16, 1983, pp. 44-45.
11. Xiong, Y., and J. B. Schneider. Transportation Network Design Using a Cumulative Genetic Algorithm and Neural Network. In Transportation Research Record 1364, TRB, National Research Council, Washington, D.C., 1992, pp. 37-44.
12. Jeon, K., J. S. Lee, S. V. Ukkusuri, and S. T. Waller. Selectorecombinative Genetic Algorithm to Relax Computational Complexity of Discrete Network Design Problem. In Transportation Research Record: Journal of the Transportation Research Board, No.1964, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 91-103.
13. Gao, Z., J. Wu, and H. Sun. Solution Algorithm for the Bi-Level Discrete Network Design Problem. Transportation Research B, Vol.39, 2005, pp. 479-495.
14. Zhang, L., S. Lawphongpanich, and Y. Yin. An Active-Set Algorithm for Discrete Network Design Problems. Proc., 18th International Symposium of Transportation and Traffic Theory (forthcoming).
15. Yin, Y., and H. Ieda. Optimal Improvement Scheme for Network Reliability. In Transportation Research Record: Journal of the Transportation Research Board, No.1783, Transportation Research Board of the National Academies, Washington, D.C., 2002, pp. 1-6.
16. Chootinan, P., S. C. Wong, and A. Chen. A Reliability-Based Network Design Problem. Journal of Advanced Transportation, Vol.39, 2005, pp. 247-270.
17. Chen, A., P. Chootinan, and S. C. Wong. New Reserve Capacity Model of Signal-Controlled Road Network. In Transportation Research Record: Journal of the Transportation Research Board, No.1964, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 35-41.
18. Sumalee, A., D. P. Watling, and S. Nakayama. Reliable Network Design Problem: The Case with Uncertain Demand and Total Travel Time Reliability. In Transportation Research Record: Journal of the Transportation Research Board, No.1964, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 81-90.
19. Lo, H. K., and Y. K. Tung. Network with Degradable Links: Capacity Analysis and Design. Transportation Research B, Vol.31, No.4, 2003, pp. 345-363.
20. Sun, Y., and M. A. Turnquist. Investment in Transportation Network Capacity Under Uncertainty: Simulated Annealing Approach. In Transportation Research Record: Journal of the Transportation Research Board, No.2039, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 67-74.
21. Stathopoulos, A., and L. Dimitriou. A Continuous Network Design Problem with Reliability Constraints: Genetic Stochastic System Design Approach. Presented at 86th Annual Meeting of the Transportation Research Board, Washington, D.C., 2007.
22. Chen, A., K. Subprasom, and Z. Ji. Mean-Variance Model for the Build- Operate-Transfer Scheme Under Demand Uncertainty. In Transportation Research Record: Journal of the Transportation Research Board, No.1857, Transportation Research Board of the National Academies, Washington, D.C., 2003, pp. 93-101.
23. Yin, Y., S. M. Madanat, and X. Y. Lu. Robust Improvement Schemes for Road Networks Under Demand Uncertainty. European Journal of Operational Research, Vol.198, 2009, pp. 470-479.
24. Ukkusuri, S., T. V. Mathew, and S. T. Waller. Robust Transportation Network Design Under Demand Uncertainty. Computer-Aided Civil and Infrastructure Engineering, Vol.22, No.1, 2007, pp. 6-18.
25. Chen, A., J. Kim, Z. Zhou, and P. Chootinan. Alpha Reliable Network Design Problem. In Transportation Research Record: Journal of the Transportation Research Board, No.2029, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 49-57.
26. Yin, Y., and S. Lawphongpanich. A Robust Approach to Continuous Network Designs with Demand Uncertainty. Transportation and Traffic Theory 2007 (R. E. Allsop, M. G. H. Bell, and B. G. Heydecker, eds.), Elsevier, London, 2007, pp. 110-126.
27. Special Report 288: Metropolitan Travel Forecasting: Current Practice and Future Directions, TRB, National Research Council, Washington D.C., 2007.
28. Bertismas, D., and M. Sim. Robust Discrete Optimization and Network Flows. Mathematical Programming, Vol.98, 2003, pp. 49-71.
29. Patriksson, M. The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, Netherlands, 1994.
30. Lawphongpanich, S., and D. W. Hearn. An MPEC Approach to Second- Best Toll Pricing. Mathematical Programming Series B, Vol.7, 2004, pp. 33-55.
31. Scheel, H., and S. Scholtes. Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity. Mathematics of Operations Research, Vol.25, 2000, pp. 1-22.
32. Birbil, S., S. Fang, and J. Han. An Entropic Regularization Approach for Mathematical Programs with Equilibrium Constraints. Computers and Operations Research, Vol.31, 2004, pp. 2249-2262.
33. Scholtes, H., and M. Stohr. Exact Penalization of Mathematical Programs with Equilibrium Constraints. SIAM Journal on Control Optimization, Vol.37, No.2, 1999, pp. 617-652.
34. Raghunathan, A., and L. Biegler. An Interior Point Method for Mathematical Programs with Complementarity Constraints. SIAM Journal on Optimization, Vol.15, No.3, 2005, pp. 720-750.
35. Luo, Z.-Q., J.-S. Pang, and D. Ralph. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, New York, 1996.
36. Fletcher, R., S. Leyffer, D. Ralph, and S. Scholtes. Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints. SIAM Journal of Optimization, Vol.17, 2006, pp. 259-286.
37. LeBlanc, L. J., E. K. Morlok, and W. P. Pierskalla. An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem. Transport Research, Vol.9, 1975, pp. 309-318.
38. Florian, M., J. Guelat, and H. Spiess. An Efficient Implementation of the PARTAN Variant of the Linear Approximation Method for the Network Equilibrium Problem. Networks, Vol.17, 1987, pp. 319-339.
39. Brooke, A., D. Kendirck, and A. Meeraus. GAMS: A User's Guide. Scientific Press, South San Francisco, Calif., 1992.
40. Drud, A. CONOPT: A Large-Scale GRG Code. ORSA Journal on Computing, Vol.6, 1994, pp. 207-216.
41. CPLEX. ILOG, Inc., Sunnyvale, Calif., 2008.
42. Yin, Y., S. Lawphongpanich, and Y. Lou. Estimating Investment Requirement for Maintaining and Improving Highway Systems. Transportation Research C, Vol.16, 2008, pp. 199-211.