Network design with node connectivity constraints

The Generalized Steiner Problem with Node-Connectivity constraints (GSPNC) consists of determining of a minimum cost subnetwork of a given network where some pairs of nodes are required to satisfy node-connectivity requirements. The GSPNC has applications to the design of low-cost communications networks which can survive failures in the servers as well as in the connection lines. The GSPNC is known to be NP-Complete. In this paper, we introduce an algorithm based on GRASP (Greedy Randomized Adaptive Search Procedure), an effective combinatorial optimization metaheuristic. Experimental results are obtained over a set of problem instances with different characteristics and connectivity requirements, obtaining in all these cases optimal or near-optimal results.

[1]  Douglas R. Shier,et al.  Iterative methods for determining the k shortest paths in a network , 1976, Networks.

[2]  I.D. Ljubic,et al.  A genetic algorithm for the biconnectivity augmentation problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[3]  K. Steiglitz,et al.  The Design of Minimum-Cost Survivable Networks , 1969 .

[4]  Mourad Baïou,et al.  Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs , 1997, SIAM J. Discret. Math..

[5]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[6]  M. Stoer.  Design of Survivable Networks , 1993 .

[7]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[8]  Mourad Baïou.  Le probleme du sous-graphe steiner 2-arete connexe : approche polyedrale , 1996 .

[9]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[10]  Jozef Kratica,et al.  A Hybrid GA for the Edge-Biconnectivity Augmentation Problem , 2000, PPSN.

[11]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[12]  Martin Grötschel,et al.  Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements , 1995, Oper. Res..

[13]  Pawel Winter,et al.  Generalized Steiner Problem in Series-Parallel Networks , 1986, J. Algorithms.

[14]  Ali Ridha Mahjoub,et al.  Two-edge connected spanning subgraphs and polyhedra , 1994, Math. Program..