Solving the two-facility network design problem with 3-partition facets

The article studies the problem of designing telecommunication networks using transmission facilities of two different capacities. The point-to-point communication demands are met by installing a mix of facilities of both capacities on the edges to minimize total cost. We consider 3-partitions of the original graph which results in smaller 3-node subproblems. The extreme points of this subproblem polyhedron are characterized using a set of propositions. A new approach for computing the facets of the 3-node subproblem is introduced based on polarity theory. The facets of the subproblem are then translated back to those of the original problem using a generalized version of a previously known theorem. The approach has been tested on several randomly generated and real life networks. The computational results show that the new family of facets significantly strengthen the linear programming formulation and reduce the integrality gap. Also, there is a substantial reduction in the size of the branch-and-bound B&B tree if these facets are used. Problems as large as 37 nodes and 57 edges have been solved to optimality within a few minutes of computer time. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 661, 11-32 2015

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

[2]  Graham McMahon,et al.  An integrated GA–LP approach to communication network design , 1999, Telecommun. Syst..

[3]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

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

[5]  Mervat Chouman,et al.  A MIP-Tabu Search Hybrid Framework for Multicommodity Capacitated Fixed-Charge Network Design , 2010 .

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

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

[8]  Yogesh Kumar Agarwal,et al.  k-Partition-based facets of the network design problem , 2006 .

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

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

[11]  Di Yuan,et al.  A Lagrangean approach to network design problems , 1998 .

[12]  Yogesh Kumar Agarwal.  Polyhedral structure of the 4-node network design problem , 2009 .

[13]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

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

[15]  Sadiq M. Sait,et al.  Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm , 2002 .

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

[17]  Ada Margarita Alvarez Socarrás,et al.  Tabu search-based algorithm for capacitated multicommodity network design problem , 2004, 14th International Conference on Electronics, Communications and Computers, 2004. CONIELECOMP 2004..

[18]  K. Onaga,et al.  On feasibility conditions of multicommodity flows in networks , 1971 .

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

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

[21]  Giorgio Giacinto,et al.  A simulated annealing algorithm for the optimization of communication networks , 1995, Proceedings of ISSE'95 - International Symposium on Signals, Systems and Electronics.

[22]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[23]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[24]  Alice E. Smith,et al.  Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics , 2003, J. Heuristics.

[25]  Alper Atamtürk,et al.  Network design arc set with variable upper bounds , 2007 .

[26]  Chi-Chun Lo,et al.  A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[27]  Abdullah Konak,et al.  Capacitated network design considering survivability: an evolutionary approach , 2004 .

[28]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

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

[30]  Antonio Sassano,et al.  Metric Inequalities and the Network Loading Problem , 2004, IPCO.

[31]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[32]  Laurence A. Wolsey,et al.  Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems , 1993 .

[33]  Chao-Hsien Chu,et al.  Genetic algorithms for communications network design - an empirical study of the factors that influence performance , 2001, IEEE Trans. Evol. Comput..

[34]  Michel Gendreau,et al.  A Simplex-Based Tabu Search Method for Capacitated Network Design , 2000, INFORMS J. Comput..

[35]  Michel Gendreau,et al.  Cooperative Parallel Tabu Search for Capacitated Network Design , 2002, J. Heuristics.

[36]  Kim-Fung Man,et al.  Using Genetic Algorithms to Design Mesh Networks , 1997, Computer.

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

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

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

[40]  Michel Gendreau,et al.  Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design , 2003, Oper. Res..