Bilevel programming model and solution method for mixed transportation network design problem

Journal of Systems Science and Complexity

Volumn 22, Issue 3, 2009, Pages 446-459

  Zhang, Haozhi ^a,b   Gao, Ziyou ^a,b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b CHINA ACADEMY OF TRANSPORTATION SCIENCES   (China)

Author keywords

Bilevel programming; Network design; Optimal value function; Penalty function method

Indexed keywords

ASSIGNMENT PROBLEMS; BI-LEVEL PROGRAMMING; BILEVEL; BILEVEL PROGRAMMING MODELS; BILEVEL PROGRAMMING PROBLEM; CONTINUATION METHOD; CONVERGENT ALGORITHMS; EQUALITY CONSTRAINTS; EQUILIBRIUM ASSIGNMENT; INNER LOOPS; LARGE-SCALE NETWORK; MIXED NETWORK; NETWORK DESIGN; NONCONVEX OPTIMIZATION; NONLINEAR BILEVEL PROGRAMMING; OPTIMIZATION PROBLEMS; PENALTY FUNCTION METHODS; SOLUTION METHODS; TRANSPORTATION NETWORK; TRAVEL COSTS; USER EQUILIBRIUM ASSIGNMENT; VALUE FUNCTIONS;

DESIGN; TRANSPORTATION; TRAVELING SALESMAN PROBLEM;

INTEGER PROGRAMMING;

EID: 71449110613     PISSN: 10096124     EISSN: 15597067     Source Type: Journal    
DOI: 10.1007/s11424-009-9177-3     Document Type: Article

References (18)

1. H. Yang and M. G. H. Bell, Models and algorithms for road network design: A review and some new developments, Transport Review, 1998, 18(3): 257-278.
2. Q. Meng, Bilevel Transportation Modeling and Optimization, Ph. D. Thesis, the Hong Kong University of Science and Technology, Hong Kong, 2000.
3. Z. Y. Gao and Y. F. Song, A reserve capacity model of optimal signal control with user equilibrium route choice, Transportation Research-B, 2002, 36(4): 313-323.
4. A. V. Lim, Transportation Network Design Problems: An MPEC Approach, Ph. D. Thesis, the Johns Hopkins University, Maryland, 2002.
5. S. W. Chiou, Bilevel programming for the continuous transport network design problem, Transportation Research-B, 2005, 39(4): 361-383.
6. L. J. Leblanc, An algorithm for the discrete network design problem, Transportation Science, 1975, 9(3): 183-199.
7. H. Poorzahedy and M. A. Turnquist, Approximate algorithms for the discrete network design problem, Transportation Research-B, 1982, 16(1): 45-55.
8. T. L. Magnanti and R. T. Wong, Network design and transportation planning: Models and algorithms, Transportation Science, 1984, 18(1): 1-55.
9. H. Yang and M. G. H. Bell, Transportation bilevel programming problems: Recent methodological advances, Transportation Research-B, 2001, 35(1): 1-4.
10. Q. Meng, 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, 2001, 35(1): 83-105.
11. Q. Meng, D. H. Lee, H Yang, and H. J. Huang, Transportation network optimization problems with stochastic user equilibrium constraints, Journal of Transportation Research Record, 2004, 1882: 113-119.
12. Z. Y. Gao, J. J. Wu, and H. J. Sun, Solution algorithm for the bi-level discrete network design problem, Transportation Research-B, 2005, 39(6): 479-495.
13. H. Yang and Q. Meng, Highway pricing and capacity choice in a road network under a Build-Operate-Transfer Scheme, Transportation Research-A, 2000, 34(3): 207-222.
14. T. A. Edmunds and J. F. Bard, An algorithm for the mixed-integer nonlinear bilevel programming problem, Annals of Operations Research, 1992, 34(2): 149-162.
15. K. Shimizu and M. Lu, A global optimization method for the Stackelberg problem with convex functions via problem transformation and concave programming, IEEE Transaction on Systems, Man, and Cybernetics, 1995, 25(12): 1635-1640.
16. T. Larsson and M. Patriksson, An augmented Lagrangian dual algorithm for link capacity side constrained traffic assignment problems, Transportation Research-B, 1995, 29(6): 433-455.
17. O. L. Mangasarian and J. B. Rosen, Inequalities for stochastic nonlinear programming problems, Operations Research, 1964, 12(1): 143-154.
18. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley, New York, 1993.