Decomposition scheme for continuous network design problem with asymmetric user equilibria

Transportation Research Record

Volumn , Issue 1964, 2006, Pages 185-192

  Ban, Xuegang ^a   Liu, Henry X ^b   Lu, Jiangang ^c   Ferris, Michael C ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

^c University of Wisconsin Madison   (United States)

^d University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

DECOMPOSITION SCHEME; DIMENSIONALITY PROBLEM; NETWORK DESIGN PROBLEM; USER EQUILIBRIA;

TELECOMMUNICATION NETWORKS;

EID: 33846886529     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1964-20     Document Type: Conference Paper

References (33)

1. LeBlanc, L., and D. E. Boyce. A Bilevel Programming Algorithm for Exact Solution of the Network Design Problem with User-Optimal Rows. Transportation Research, Vol. 20B, 1986, pp. 259-265.
2. Morlok, E. K. Development and Application of a Highway Network Design Model. FHWA, U.S. Department of Transportation, 1973.
3. Tan, H.-N., S. B. Gershwin, and M. Athana. Hybrid Optimization in Urban Traffic Networks. Report DOT-TSC-RSPA-79-7. Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, 1979.
4. Marcotte, P. Network Optimization with Continuous Control Parameters. Transportation Science, Vol. 17, 1983, pp. 181-197.
5. 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.
6. Friesz, T. L. Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Transportation Science, Vol. 26, 1992, pp. 18-26.
7. Yang, H. Sensitivity Analysis for the Elastic Demand Network Equilibrium Problem with Applications. Transportation Research, Vol. 31B, 1997, pp. 55-70.
8. Yang, H., and M. G. H. Bell. Transport Bilevel Programming Problems: Recent Methodological Advances. Transportation Research, Vol. 35B, 2001, pp. 1-4.
9. Outrata, J., M. Kocvara, and J. Zowe. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, 1998.
10. Luo, Z.-Q., J. S. Pang, and D. Ralph. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, United Kingdom, 1996.
11. 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, Vol. 35B, 2001, pp. 83-105.
12. Marcotte, P., and D. L. Zhu. Exact and Inexact Penalty Methods for the Generalized Bilevel Programming Problem. Mathematical Programming, Vol. 74, 1996, pp. 141-157.
13. Patriksson, M., and R. T. Rockafellar. A Mathematical Model and Descent Algorithm for Bilevel Traffic Management. Transportation Science, Vol. 36, 2002, pp. 271-291.
14. Ban, X. G., X. H. Liu, and M. C. Ferns. A General MPCC Model and Its Solution Algorithm for Continuous Network Design Problem. Mathematical and Computer Modeling, Vol. 43, No. 5-6, 2006, pp. 493-505.
15. Scheel, H., and S. Scholte. Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity. Mathematics of Operations Research, Vol. 22, No. 1, 2000, pp. 1-22.
16. Anitescu, M. On Solving Mathematical Programs with Complementarity Constraints as Nonlinear Programs. Preprint ANL/MCS-P864-1200. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, III., 2000.
17. Anitescu, M. Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints. Preprint ANL/MCS-P1143-0404. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., 2004.
18. Fletcher, R., and S. Leyffer. Solving Mathematical Programs with Complementarity Constraints as Nonlinear Programs. Optimization Methods and Software, Vol. 19, No. 1, 2004, pp. 15-40.
19. Hu, X., and D. Ralph. A Note on Sensitivity of Value Functions of Mathematical Programs with Complementarity Constraints. Mathematical Programming, Vol. 93, No. 2, 2002, pp. 265-279.
20. Jiang, H., and D. Ralph. Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints. Society for Industrial Applied Mathematics Journal of Optimization, Vol. 10, No. 3, 2000, pp. 779-808.
21. Jiang, H., and D. Ralph. Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints. Computational Optimization and Applications, Vol. 25, No. 1-3, 2003, pp. 123-150.
22. Ferris, M. C., S. P. Dirkse, and A. Meeraus. Mathematical Programs with Equilibrium Constraints: Automatic Reformulation and Solution via Constrained Optimization. Numerical Analysis Group Research Report NA-02/11. Oxford University Computing Laboratory, Oxford University, Oxford, United Kingdom, 2002.
23. Ferris, M. C., S. P. Dirkse, and A. Meeraus. Mathematical Programs with Equilibrium Constraints: Automatic Reformulation and Solution via Constrained Optimization. In Frontiers in Applied General Equilibrium Modeling (T. J. Kehoe, T. N. Srinivasan, and J. Whalley, eds.), Cambridge University Press, Cambridge, United Kingdom, 2004.
24. Brooke, A., D. Kendrick, and A. Meeraus. GAMS, a User's Guide. GAMS Development Corporation, 1998.
25. Ralph, D., and S. J. Wright. Some Properties of Regularization and Penalization Schemes for MPECs. Optimization Methods and Software, Vol. 19, 2004, pp. 527-556.
26. Ban, X. G. Quasi-Variational Inequality Formulations and Solution Approaches for Dynamic User Equilibria. Ph.D. thesis. University of Wisconsin, Madison, 2005.
27. Onega, J. M., and W. C. Rheinboldt. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.
28. Zadeh, N. A Note on the Cyclic Coordinate Ascent Method. Management Science, Vol. 16, 1969-1970, pp. 642-644.
29. Bertsekas, D. P., and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, London, 1997.
30. Boyce, D. E., B. Ralevic-Dekic, and H. Bar-Gera. Convergence of Traffic Assignment: How Much Is Enough? Journal of Transportation Engineering, ASCE, Vol. 130, No. 1, 2004, pp. 49-55.
31. LeBlanc, L. An Algorithm for the Discrete Network Design Problem. Transportation Science, Vol. 9, 1975, pp. 183-199.
32. Murtagh, B. A. and M. A. Saunders. The Implementation of a Lagrangian-Based Algorithm for Sparse Nonlinear Constraints. SOL Technical Report. Stanford University, Stanford, California, 1981.
33. Abdulaal, M., and L. J. LeBlanc. Continuous Equilibrium Network Design Models. Transportation Research, Vol. 13B, 1979, pp. 19-32.