Integration of equipment constraints in the network topology design process

This paper studies a topical capacitated network design problem that arises in the telecommunication industry. In this problem, given point-to-point demand between various pairs of nodes, a minimum cost survivable network must be designed by installing equipments (routers, line cards, …) on nodes as well as link facilities on arcs. This realistic problem finds its motivation in the rapidly developing field of telecommunication networks and the introduction of fiber-optic technology. It is, in particular, faced by the network designer whenever a new network is set up. To the best of our knowledge, this is the first work that addresses this capacitated network design problem where equipments, such as routers and lines cards, have to be settled on network nodes. We present in this paper a comprehensive model to our network design problem. One exact algorithm and two heuristic approaches are proposed to solve this problem. Numerical results are provided for randomly generated networks and networks coming from real-word applications.

[1]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

[2]  Prakash Mirchandani,et al.  Modeling and Solving the Capacitated Network Loading Problem , 1991 .

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

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

[5]  Toshimasa Watanabe,et al.  Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase , 2006, IEICE Trans. Inf. Syst..

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

[7]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

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

[9]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

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

[12]  Francesco Maffioli,et al.  Solving the Two-Connected Network with Bounded Meshes Problem , 2000, Oper. Res..

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

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

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

[16]  Antonio Frangioni,et al.  0-1 Reformulations of the Multicommodity Capacitated Network Design Problem , 2009, Discret. Appl. Math..

[17]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.