Abstract
By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower-level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an all-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.
Similar content being viewed by others
References
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.
Q. Meng, Bilevel Transportation Modeling and Optimization, Ph.D. Thesis, the Hong Kong University of Science and Technology, Hong Kong, 2000.
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.
A. V. Lim, Transportation Network Design Problems: An MPEC Approach, Ph.D. Thesis, the Johns Hopkins University, Maryland, 2002.
S. W. Chiou, Bilevel programming for the continuous transport network design problem, Transportation Research-B, 2005, 39(4): 361–383.
L. J. Leblanc, An algorithm for the discrete network design problem, Transportation Science, 1975, 9(3): 183–199.
H. Poorzahedy and M. A. Turnquist, Approximate algorithms for the discrete network design problem, Transportation Research-B, 1982, 16(1): 45–55.
T. L. Magnanti and R. T. Wong, Network design and transportation planning: Models and algorithms, Transportation Science, 1984, 18(1): 1–55.
H. Yang and M. G. H. Bell, Transportation bilevel programming problems: Recent methodological advances, Transportation Research-B, 2001, 35(1): 1–4.
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.
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.
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.
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.
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.
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.
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.
O. L. Mangasarian and J. B. Rosen, Inequalities for stochastic nonlinear programming problems, Operations Research, 1964, 12(1): 143–154.
M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley, New York, 1993.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Basic Research Program of China under Grant No. 2006CB705500, the National Natural Science Foundation of China under Grant No. 0631001, the Program for Changjiang Scholars and Innovative Research Team in University, and Volvo Research and Educational Foundations.
Rights and permissions
About this article
Cite this article
Zhang, H., Gao, Z. Bilevel programming model and solution method for mixed transportation network design problem. J Syst Sci Complex 22, 446–459 (2009). https://doi.org/10.1007/s11424-009-9177-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-009-9177-3