Optimal switch location in mobile communication networks using hybrid genetic algorithms

The optimal positioning of switches in a mobile communication network is an important task, which can save costs and improve the performance of the network. In this paper we propose a model for establishing which are the best nodes of the network for allocating the available switches, and several hybrid genetic algorithms to solve the problem. The proposed model is based on the so-called capacitated p-median problem, which have been previously tackled in the literature. This problem can be split in two subproblems: the selection of the best set of switches, and a terminal assignment problem to evaluate each selection of switches. The hybrid genetic algorithms for solving the problem are formed by a conventional genetic algorithm, with a restricted search, and several local search heuristics. In this work we also develop novel heuristics for solving the terminal assignment problem in a fast and accurate way. Finally, we show that our novel approaches, hybridized with the genetic algorithm, outperform existing algorithms in the literature for the p-median problem.

[1]  Xin Yao,et al.  A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  B. Sengupta,et al.  Assignment of cells to switches in PCS networks , 1995, TNET.

[3]  Barrett R. Bryant,et al.  Proceedings of the 1997 ACM symposium on Applied Computing, SAC'97, San Jose, CA, USA, February 28 - March 1 , 1997, SAC.

[4]  Werner Neu,et al.  Mobile Termination Cost Model for Australia , 2007 .

[5]  Geraldo Robson Mateus,et al.  Model and heuristic for a generalized access network design problem , 2000, Telecommun. Syst..

[6]  S. Menon,et al.  Assigning cells to switches in cellular networks by incorporating a pricing mechanism into Simulated annealing , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  Morten Riis,et al.  Deployment of Mobile Switching Centers in a Telecommunications Network: A Stochastic Programming Approach , 2004, Telecommun. Syst..

[8]  Zoltán Fiala,et al.  Two new algorithms for UMTS access network topology design , 2005, Eur. J. Oper. Res..

[9]  Eric Rosenberg.  Dual Ascent for Uncapacitated Telecommunications Network Design with Access, Backbone, and Switch Costs , 2001, Telecommun. Syst..

[10]  Alex Alves Freitas,et al.  A Genetic Algorithm for Solving a Capacitated p-Median Problem , 2004, Numerical Algorithms.

[11]  Hasan Pirkul,et al.  Locating concentrators for primary and secondary coverage in a computer communications network , 1988, IEEE Trans. Commun..

[12]  Roger L. Wainwright,et al.  Terminal assignment in a communications network using genetic algorithms , 1994, CSC '94.

[13]  Alejandro Quintero,et al.  Assigning cells to switches in cellular mobile networks: a comparative study , 2003, Comput. Commun..

[14]  Chao-Hsien Chu,et al.  Digital data networks design using genetic algorithms , 2000, Eur. J. Oper. Res..

[15]  Xin Yao,et al.  Hybrid Evolutionary Approaches to Terminal Assignment in Communications Networks , 2005 .

[16]  Roberto Baldacci,et al.  A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.

[17]  Costas Courcoubetis,et al.  Pricing Communication Networks , 2003 .

[18]  Zvi Drezner,et al.  An Efficient Genetic Algorithm for the p-Median Problem , 2003, Ann. Oper. Res..

[19]  Pablo Cortés,et al.  Genetic algorithm for planning cable telecommunication networks , 2001, Appl. Soft Comput..

[20]  Steven Chamberland,et al.  A constraint programming approach for the design problem of cellular wireless networks , 2003, CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436).

[21]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[22]  Larry J. LeBlanc,et al.  Telecommunication access network design with reliability constraints , 2004, IEEE Transactions on Reliability.

[23]  Samuel Pierre,et al.  Assigning cells to switches in cellular mobile networks using taboo search , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[24]  Stephen B. Wicker,et al.  Base Station Location Optimization in Cellular Wireless Networks using Heuristic Search Algorithms , 2004 .

[25]  D.E. Dodds,et al.  A two-phase genetic K-means algorithm for placement of radioports in cellular networks , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[26]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[27]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[28]  Joaquín A. Pacheco,et al.  Solving two location models with few facilities by using a hybrid heuristic: a real health resources case , 2005, Comput. Oper. Res..

[29]  Fernando Pérez-Cruz,et al.  Enhancing genetic feature selection through restricted search and Walsh analysis , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[30]  Steven Chamberland,et al.  An efficient heuristic for the expansion problem of cellular wireless networks , 2004, Comput. Oper. Res..

[31]  Sami Khuri,et al.  Heuristic algorithms for the terminal assignment problem , 1997, SAC '97.

[32]  L. A. Lorena,et al.  School location methodology in urban areas of developing countries , 2004 .

[33]  Sancho Salcedo-Sanz,et al.  Improving metaheuristics convergence properties in inductive query by example using two strategies for reducing the search space , 2007, Comput. Oper. Res..

[34]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[35]  Klaus D. Hackbarth,et al.  Cost Models for Telecommunication Networks and Their Application to GSM Systems , 2005 .