Wide area telecommunication network design: application to the Alberta SuperNet

This article proposes a solution methodology for the design of a wide area telecommunication network. This study is motivated by the Alberta SuperNet project, which provides broadband Internet access to 422 communities across Alberta. There are two components to this problem: the network design itself, consisting of selecting which links will be part of the solution and which nodes should house shelters; and the loading problem which consists of determining which signal transport technology should be installed on the selected edges of the network. Mathematical models are described for these two subproblems. A tabu search algorithm heuristic is developed and tested on randomly generated instances and on Alberta SuperNet data.

[1]  Alysson M. Costa,et al.  Steiner Tree Problems With Profits , 2006 .

[2]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[3]  Ali Ridha Mahjoub,et al.  Design of Survivable Networks: A survey , 2005, Networks.

[4]  Raymond A. Patterson,et al.  The network design problem with relays , 2007, Eur. J. Oper. Res..

[5]  Inmaculada Rodríguez Martín,et al.  The Ring Star Problem: Polyhedral analysis and exact algorithm , 2004, Networks.

[6]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

[7]  Robert Doverspike,et al.  Heuristic approaches for telecommunications network management, planning and expansion : a special issue of the Journal of heuristics , 2000 .

[8]  Erik Rolland,et al.  A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem , 1999, J. Heuristics.

[9]  Hanan Luss,et al.  Design of Stacked Self-Healing Rings Using a Genetic Algorithm , 2000, J. Heuristics.

[10]  Thomas L. Magnanti,et al.  Designing Hierarchical Survivable Networks , 1998, Oper. Res..

[11]  Abilio Lucena,et al.  A branch and cut algorithm for the Steiner problem in graphs , 1998, Networks.

[12]  Henrique Pacca Loureiro Luna,et al.  A Comparison of Optimal Methods for Local Access Uncapacitated Network Design , 2001, Ann. Oper. Res..

[13]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[14]  Thorsten Koch,et al.  Solving Steiner tree problems in graphs to optimality , 1998, Networks.

[15]  Siavash Vahdati Daneshmand,et al.  Improved algorithms for the Steiner problem in networks , 2001, Discret. Appl. Math..

[16]  Steven Chamberland,et al.  On the Design Problem of Multitechnology Networks , 1999, INFORMS J. Comput..

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

[18]  Jean-Louis Goffin,et al.  Exact solution of the centralized network design problem on directed graphs , 2005, Networks.

[19]  Siavash Vahdati Daneshmand,et al.  A comparison of Steiner tree relaxations , 2001, Discret. Appl. Math..

[20]  Siavash Vahdati Daneshmand,et al.  On Steiner trees and minimum spanning trees in hypergraphs , 2003, Oper. Res. Lett..

[21]  S. Raghavan,et al.  Strong formulations for network design problems with connectivity requirements , 2005, Networks.

[22]  S. Handy.  NETWORK CONNECTIVITY , 2010 .

[23]  Sunil Chopra,et al.  A branch-and-cut approach for minimum cost multi-level network design , 2002, Discret. Math..

[24]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[25]  Steven Chamberland,et al.  Topological expansion of multiple-ring metropolitan area networks , 1997, Networks.

[26]  Steven Chamberland,et al.  Topological Design of Two-Level Telecommunication Networks with Modular Switches , 1997, Oper. Res..