Solution algorithm for the bi-level discrete network design problem

The discrete network design problem deals with the selection of link additions to an existing road network, with given demand from each origin to each destination. The objective is to make an optimal investment decision in order to minimize the total travel cost in the network, while accounting for the route choice behaviors of network users. Because of the computational difficulties experienced with the solution algorithm of nonlinear bi-level mixed integer programming with a large number of 0-1 variables, the discrete network design problem has been recognized as one of the most difficult yet challenging problems in transport. In this paper, at first a traditional bi-level programming model for the discrete network design problem is introduced, and then a new solution algorithm is proposed by using the support function concept to express the relationship between improvement flows and the new additional links in the existing urban network. Finally, the applications of the new algorithm are illustrated with two numerical examples. Numerical results indicate that the proposed algorithm would be efficient in practice.

[1]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[2]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[3]  Hai Yang,et al.  An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem , 2001 .

[4]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[5]  Jonathan F. Bard,et al.  A Branch and Bound Algorithm for the Bilevel Programming Problem , 1990, SIAM J. Sci. Comput..

[6]  Hai Yang,et al.  Traffic Assignment and Traffic Control in General Freeway-arterial Corridor Systems , 1994 .

[7]  Agachai Sumalee,et al.  Reliable Network Design Problem: Case with Uncertain Demand and Total Travel Time Reliability , 2006 .

[8]  Gary A. Davis,et al.  Exact local solution of the continuous network design problem via stochastic user equilibrium assignment , 1994 .

[9]  Attahiru Sule Alfa,et al.  A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach , 1991, Transp. Sci..

[10]  Terry L. Friesz,et al.  TRANSPORTATION NETWORK EQUILIBRIUM, DESIGN AND AGGREGATION: KEY DEVELOPMENTS AND RESEARCH OPPORTUNITIES. IN: THE AUTOMOBILE , 1985 .

[11]  Shing Chung Josh Wong,et al.  Reserve capacity of a signal-controlled road network , 1997 .

[12]  Song Yifan,et al.  A reserve capacity model of optimal signal control with user-equilibrium route choice , 2002 .

[13]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[14]  Patrick T. Harker,et al.  Properties of the iterative optimization-equilibrium algorithm , 1985 .

[15]  David E. Boyce,et al.  Construction of a real-world bilevel linear programming model of the highway network design problem , 1992, Ann. Oper. Res..

[16]  Suh-Wen Chiou,et al.  Bilevel programming for the continuous transport network design problem , 2005 .

[17]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[18]  David E. Boyce,et al.  Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects , 1984 .

[19]  David E. Boyce,et al.  A general bilevel linear programming formulation of the network design problem , 1988 .

[20]  Suh-Wen Chiou,et al.  Optimization of Area Traffic Control for Equilibrium Network Flows , 1999, Transp. Sci..

[21]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[22]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[23]  Huijun Sun,et al.  A continuous equilibrium network design model and algorithm for transit systems , 2004 .

[24]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[25]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[26]  Jonathan F. Bard,et al.  An algorithm for the mixed-integer nonlinear bilevel programming problem , 1992, Ann. Oper. Res..

[27]  George B. Dantzig,et al.  Formulating and solving the network design problem by decomposition , 1979 .

[28]  Tschangho John Kim.  Advanced Transport and Spatial Systems Models: Applications to Korea , 1990 .

[29]  R. Weischedel,et al.  Optimal Network Problem: A Branch-and-Bound Algorithm , 1973 .

[30]  Patrice Marcotte,et al.  Efficient implementation of heuristics for the continuous network design problem , 1992, Ann. Oper. Res..

[31]  Terry L. Friesz,et al.  Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem , 1987, Transp. Sci..

[32]  Peter A. Steenbrink,et al.  Transport network optimization in the Dutch integral transportation study , 1974 .

[33]  J. Bard,et al.  An algorithm for the discrete bilevel programming problem , 1992 .

[34]  George B. Dantzig,et al.  THE APPLICATION OF DECOMPOSITION TO TRANSPORTATION NETWORK ANALYSIS , 1976 .

[35]  C. Floudas.  Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications , 1995 .