Evolutionary approach to optimize the assignment of cells to switches in personal communication networks

This paper proposes an evolutionary approach to solve the problem of assigning cells to switches in the planning phase of mobile cellular networks. Well-known in the literature as an NP-hard combinatorial optimization problem, this problem requires the recourse to heuristic methods, which can practically lead to good feasible solutions, not necessarily optimal, the objective being rather to reduce the convergence time toward these solutions. Computational results obtained from extensive tests confirm the effectiveness of this approach to provide good solutions to problems of a certain size. This approach can be used to solve NP-hard problems, like designing and planning, in the next generation networking systems.

[1]  E. Cantu-Paz.  On the Effects of Migration on the Fitness Distribution of Parallel Evolutionary Algorithms , 2000 .

[2]  Peter Ross,et al.  A Study of Genetic Algorithm Hybrids for Facility Layout Problems , 1995, ICGA.

[3]  C. Wheatley.  Trading coverage for capacity in cellular systems , 1995, Proceedings of 1995 IEEE MTT-S International Topical Symposium on Technologies for Wireless Applications (Conjunction with INTER COMM'95).

[4]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[5]  Fabien Houéto,et al.  A tabu search approach for assigning cells to switches in cellular mobile networks , 2002, Comput. Commun..

[6]  Shigeyoshi Tsutsui,et al.  Genetic algorithms with a robust solution searching scheme , 1997, IEEE Trans. Evol. Comput..

[7]  Oliver Vornberger,et al.  Hybrid genetic algorithms for constrained placement problems , 1997, IEEE Trans. Evol. Comput..

[8]  David E. Goldberg,et al.  Predicting Speedups of Ideal Bounding Cases of Parallel Genetic Algorithms , 1997, ICGA.

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

[10]  Tzung-Pei Hong,et al.  Integrating fuzzy knowledge by genetic algorithms , 1998, IEEE Trans. Evol. Comput..

[11]  Mateo Valero,et al.  Parallel computing and transputer applications , 1992 .

[12]  D.P. Reed.  The cost structure of personal communication services , 1993, IEEE Communications Magazine.

[13]  Marco Tomassini,et al.  Fuzzy Evolutionary Algorithms , 2001 .

[14]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[15]  Yuguang Fang,et al.  Modeling PCS networks under general call holding time and cell residence time distributions , 1997, TNET.

[16]  Amitava Mukherjee,et al.  Heuristics for assignment of cells to switches in a PCSN: a comparative study , 1999, 1999 IEEE International Conference on Personal Wireless Communications (Cat. No.99TH8366).

[17]  Ralf Salomon,et al.  Evolutionary algorithms and gradient search: similarities and differences , 1998, IEEE Trans. Evol. Comput..

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

[19]  Amitava Mukherjee,et al.  A Simple Heuristic for Assignment of Cells to Switches in a PCS Network , 2000, Wirel. Pers. Commun..

[20]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[21]  Olivier François,et al.  An evolutionary strategy for global minimization and its Markov chain analysis , 1998, IEEE Trans. Evol. Comput..

[22]  Peter D. Turney.  Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm , 1994, J. Artif. Intell. Res..

[23]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[24]  P.R.L. Gondim,et al.  Genetic algorithms and the location area partitioning problem in cellular networks , 1996, Proceedings of Vehicular Technology Conference - VTC.

[25]  Katta G. Murty,et al.  On KΔ , 1986, Discret. Appl. Math..

[26]  Martina Gorges-Schleuter,et al.  Explicit Parallelism of Genetic Algorithms through Population Structures , 1990, PPSN.

[27]  Ralph W. Wilkerson,et al.  A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function , 1993, SAC '93.

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

[29]  D. Goldberg,et al.  Predicting Speedups of Idealized Bounding Cases of Parallel Genetic Algorithms , 1997 .

[30]  N. Mort,et al.  Hybrid Genetic Algorithms for Telecommunications Network Back-Up Routeing , 2000 .

[31]  David B. Fogel,et al.  An Overview of Evolutionary Programming , 1999 .

[32]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[33]  Arif Merchant,et al.  Multiway graph partitioning with applications to PCS networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[34]  Bernd Freisleben,et al.  Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem , 1998, PPSN.

[35]  Bezalel Gavish,et al.  Economic aspects of configuring cellular networks , 1995, Wirel. Networks.

[36]  A. Dickson.  On Evolution , 1884, Science.