Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound

The network design problem is a multicommodity minimal cost network flow problem with fixed costs on the arcs, i.e., a structured linear mixed-integer programming problem. It has various applications, such as construction of new links in transportation networks, topological design of computer communication networks, and planning of empty freight car transportation on railways. We present a Lagrangean heuristic within a branch-and-bound framework as a method for finding the exact optimal solution of the uncapacitated network design problem with single origins and destinations for each commodity (the simplest problem in this class, but still NP-hard). The Lagrangean heuristic uses a Lagrangean relaxation as subproblem, solving the Lagrange dual with subgradient optimization, combined with a primal heuristic (the Benders subproblem) yielding primal feasible solutions. Computational tests on problems of various sizes (up to 1000 arcs, 70 nodes and 138 commodities or 40 nodes and 600 commodities) and of several different structures lead to the conclusion that the method is quite powerful, outperforming for example a state-of-the-art mixed-integer code, both with respect to problem size and solution time.

[1]  J. Kornai,et al.  Two-Level Planning , 1965 .

[2]  M. D. Devine,et al.  A Modified Benders' Partitioning Algorithm for Mixed Integer Programming , 1977 .

[3]  Giorgio Gallo,et al.  Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.

[4]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[5]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[6]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[7]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[8]  Kaj Holmberg,et al.  On the convergence of cross decomposition , 1990, Math. Program..

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

[10]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[11]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[12]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[13]  Athanasios Migdalas,et al.  A characterization of the uncapacitated network design polytope , 1992, Oper. Res. Lett..

[14]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[15]  Jeffery L. Kennington,et al.  A generalization of Polyak's convergence result for subgradient optimization , 1987, Math. Program..

[16]  K. Holmberg.  Mean value cross decomposition applied to integer programming problems , 1997 .

[17]  HolmbergKaj,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-And-Bound , 1998 .

[18]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[19]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[20]  Thomas L. Magnanti.  NETWORK DESIGN AND TRANSPORTATION PLANNING , 1990 .

[21]  Athanasios Migdalas.  Mathematical programming techniques for analysis and design of communication and transportation networks , 1988 .

[22]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[23]  K. Holmberg.  Linear mean value cross decomposition: A generalization of the Kornai-Liptak method , 1992 .

[24]  Tony J. Van Roy,et al.  Cross decomposition for mixed integer programming , 1983, Math. Program..

[25]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .