Solving the Capacitated Local Access Network Design Problem

We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes to a sink node and to install transmission facilities on the edges of the graph to accommodate the flow at minimum cost. We give a branch-and-bound algorithm that solves relaxations obtained by approximating the noncontinuous cost function by its lower convex envelope. The approximations are refined by branching on the flow ranges on selected edges. Our computational experiments indicate that this method is effective in solving moderate-size problems and provides very good candidate solutions early in the branch-and-bound tree.

[1]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[2]  Alper Atamtürk,et al.  On splittable and unsplittable flow capacitated network design arc–set polyhedra , 2002, Math. Program..

[3]  Sudipto Guha,et al.  A constant factor approximation for the single sink edge installation problems , 2001, STOC '01.

[4]  Francisco Barahona,et al.  Network Design Using Cut Inequalities , 1996, SIAM J. Optim..

[5]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[6]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[7]  R. Ravi,et al.  Approximating the Single-Sink Link-Installation Problem in Network Design , 2001, SIAM J. Optim..

[8]  A. M. Andrew,et al.  Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..

[9]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[10]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[11]  Bezalel Gavish,et al.  Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..

[12]  Kurt Mehlhorn,et al.  The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

[13]  MirchandaniPrakash,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995 .

[14]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[15]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[16]  Philippe Refalo.  Tight Cooperation and Its Application in Piecewise Linear Optimization , 1999, CP.

[17]  R. Ravi,et al.  On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem , 2001, IPCO.

[18]  R. Ravi,et al.  Buy-at-bulk network design: approximating the single-sink edge installation problem , 1997, SODA '97.

[19]  Itzhak Gilboa,et al.  Source Sink Flows with Capacity Installation in Batches , 1998, Discret. Appl. Math..

[20]  Prakash Mirchandani.  Projections of the capacitated network loading problem , 2000, Eur. J. Oper. Res..

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[23]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[24]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[25]  Oktay Günlük,et al.  Computational experience with a difficult mixedinteger multicommodity flow problem , 1995, Math. Program..

[26]  Kunal Talwar,et al.  The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap , 2002, IPCO.

[27]  Alper Atamtürk,et al.  On capacitated network design cut–set polyhedra , 2002, Math. Program..

[28]  Hasan Pirkul,et al.  Routing and capacity assignment in backbone communication networks , 1997, Comput. Oper. Res..

[29]  Thomas L. Magnanti,et al.  Shortest paths, single origin-destination network design, and associated polyhedra , 1993, Networks.

[30]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[31]  Jean-Yves Potvin,et al.  Tabu Search for a Network Loading Problem with Multiple Facilities , 2000, J. Heuristics.

[32]  Daliborka Stanojević,et al.  A Note on Search by Objective Relaxation , 2006 .

[33]  Thomas L. Magnanti,et al.  A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems , 2003, Manag. Sci..

[34]  John N. Hooker,et al.  Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers , 2002, Annals of Mathematics and Artificial Intelligence.

[35]  George L. Nemhauser,et al.  Models for representing piecewise linear cost functions , 2004, Oper. Res. Lett..

[36]  Michel Minoux,et al.  A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem , 2003, J. Heuristics.