A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem

Discrete network design problem (DNDP) is generally formulated as a bi-level programming. Because of non-convexity of bi-level formulation of DNDP which stems from the equilibrium conditions, finding global optimal solutions are very demanding. In this paper, a new branch and bound algorithm being able to find exact solution of the problem is presented. A lower bound for the upper-level objective and its computation method are developed. Numerical experiments show that our algorithm is superior to previous algorithms in terms of both computation time and solution quality. The conducted experiments indicate that in most cases the first incumbent solution which is obtained within a few seconds is superior to the final solution of some of previous algorithms.

[1]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

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

[3]  Terry L. Friesz,et al.  A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints , 1992, Transp. Sci..

[4]  Yang Sun,et al.  Mixed Transportation Network Design Based on Immune Clone Annealing Algorithm , 2009 .

[5]  Mathias Stolpe,et al.  Generalized Benders’ Decomposition for topology optimization problems , 2011, J. Glob. Optim..

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

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

[8]  H. Poorzahedy,et al.  Application of Ant System to network design problem , 2005 .

[9]  Hao Xia,et al.  On the degradation of performance for traffic networks with oblivious users , 2011 .

[10]  Chi-Kang Lee,et al.  NETWORK DESIGN OF ONE‐WAY STREETS WITH SIMULATED ANNEALING , 2005 .

[11]  W. Y. Szeto,et al.  Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks , 2012 .

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

[13]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

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

[15]  Heng Wei,et al.  Study on continuous network design problem using simulated annealing and genetic algorithm , 2009, Expert Syst. Appl..

[16]  Heng Wei,et al.  Study on continuous network design problem using simulated annealing and genetic algorithm , 2009, Expert Syst. Appl..

[17]  Mark S. Daskin,et al.  NETWORK DESIGN APPLICATION OF AN EXTRACTION ALGORITHM FOR NETWORK AGGREGATION. , 1983 .

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

[19]  Xiaoling Sun,et al.  Nonlinear Integer Programming , 2006 .

[20]  Hossain Poorzahedy,et al.  Hybrid meta-heuristic algorithms for solving network design problem , 2007, Eur. J. Oper. Res..

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

[22]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[23]  David E. Boyce,et al.  A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows , 1986 .

[24]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

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

[26]  Ziyou Gao,et al.  Solution algorithm for the bi-level discrete network design problem , 2005 .

[27]  Won-Kyu Kim,et al.  An equilibrium network design model with a social cost function for multimodal networks , 2006 .

[28]  Yafeng Yin,et al.  An Active-set Algorithm for Discrete Network Design Problems , 2009 .

[29]  M. Sepehri,et al.  A Single-Level Mixed Integer Linear Formulation for a Bi-Level Discrete Network Design Problem , 2011 .

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

[31]  Ahmed Kafafy,et al.  Hybrid Evolutionary Metaheuristics for Multiobjective Decision Support. (Métaheuristiques hybrides évolutionnaires pour l'aide à la décision multi-objectifs) , 2013 .

[32]  Peter A. Steenbrink,et al.  Optimization of Transport Networks , 1974 .

[33]  Chi Xie,et al.  Robust Optimization Model for a Dynamic Network Design Problem Under Demand Uncertainty , 2011 .

[34]  Carlo Albert,et al.  A Simulated Annealing Approach to Bayesian Inference , 2015, ArXiv.

[35]  Zvi Drezner,et al.  Using hybrid metaheuristics for the one‐way and two‐way network design problem , 2002 .

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

[37]  H. Lo,et al.  Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach , 2011 .

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

[39]  S. Waller,et al.  Dynamic Continuous Network Design Problem , 2006 .

[40]  Shing Chung Josh Wong,et al.  Transportation and Traffic Theory 2009: Golden Jubilee: Papers Selected for Presentation at Isttt 18, a Peer Reviewed Series Since 1959 , 2009 .

[41]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[42]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[43]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..

[44]  Ziyou Gao,et al.  Bilevel programming model and solution method for mixed transportation network design problem , 2009, J. Syst. Sci. Complex..

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

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

[47]  Dung-Ying Lin,et al.  A Dantzig-Wolfe Decomposition Based Heuristic Scheme for Bi-level Dynamic Network Design Problem , 2011 .

[48]  Yu Nie,et al.  A class of bush-based algorithms for the traffic assignment problem , 2009 .

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

[50]  Michael Patriksson,et al.  The Traffic Assignment Problem: Models and Methods , 2015 .

[51]  Hong Kam Lo,et al.  Global Optimum of the Linearized Network Design Problem with Equilibrium Flows , 2010 .

[52]  Jerry B. Schneider,et al.  TRANSPORTATION NETWORK DESIGN USING A CUMULATIVE GENETIC ALGORITHM AND NEURAL NETWORK , 1992 .