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

Computer Communications

Volumn 26, Issue 9, 2003, Pages 927-938

  Quintero, Alejandro ^a   Pierre, Samuel ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Cell assignment; Cellular networks; Genetic algorithms; Memetic algorithms; Migration; Multi population algorithm; Simulated annealing; Tabu search

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MOBILE TELECOMMUNICATION SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING; SWITCHING NETWORKS;

MEMETIC ALGORITHMS;

PERSONAL COMMUNICATION SYSTEMS;

EID: 0038756068     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(02)00238-4     Document Type: Article

References (37)

1. Bhattacharjee P., Saba D., Mukherjee A. Heuristics for assignment of cells to switches in a pcsn: a comparative study. International Conference on Personal Wireless Communications, Jaipur, India. 1999;331-334.
2. Beaubrun R., Pierre S., Conan J. An efficient method for optimizing the assignment of cells to MSCs in PCS networks. Proceedings 11th International Conference on Wireless Comm., Wireless 99, Calgary (AB). 1:1999;259-265.
3. Cantú-Paz E. On the effects of migration on the fitness distribution of parallel evolutionary algorithms. Proceedings of Genetic and Evolutionary Computational Conference Workshop Program, Las Vegas, Nevada. 8:2000;3.
4. Cantú-Paz E., Goldberg D. Koza J., Deb K., Dorigo M., Fogel D., Garzon M., Iba H., Riolo R. Genetic Programming, Proceedings of the Second Annual Conference, San Francisco. 1997;353-361 Morgan Kaufmann, Los Altos, CA.
5. Cantú-Paz E., Goldberg D. Predicting speedups of idealized bounding cases of parallel genetic algorithms. Back T. Proceedings of the Seventh International Conference on Genetic Algorithms, San Francisco. 1997;113-121 Morgan Kaufmann, Los Altos, CA.
6. Ching-Hung W., Tzung-Pei H., Shian-Shyong T. Integrating fuzzy knowledge by genetic algorithms. IEEE Transactions on Evolutionary Computation. 2:(4):1998;138-149.
7. Fang Y., Chlamtac I., Lin Y., Modeling P.C.S. Networks under general call holding time and cell residence time distributions. IEEE/ACM Transactions on Networking. 5:(6):1997;893-905.
8. Fogel D. Davis L., De Jong K., Vose M., Whitley L.D. An Overview of Evolutionary Programming, Evolutionary Algorithms, IMA Volumes in Mathematics and its Applications. 1999;89-109 Springer, Berlin.
9. Fogel D. Miettinen K., Mäkela M.M., Neittaanmaki P., Periaux J. An introduction to evolutionary computation and some applications, Evolutionary Algorithms in Engineering and Computer Science. 1999;23-41 Wiley, Chichester, UK.
10. Fogel D. Evolutionary Computation. 1995;IEEE Press, Piscataway, NJ. pp. 38-43.
11. Gavish B., Sridhar S. Economic aspects of configuring cellular networks. Wireless Networks. 1:(1):1995;115-128.
12. Georges-Schleuter M. Explicit Parallelism of Genetic Algorithms Through Populations Structures, Parallel Problem Solving from Nature. 1991;Springer, Berlin. pp. 150-159.
13. Glover F., Taillard E., de Werra D. A user's guide to tabu search. Annals of Operations Research. 41:(3):1993;3-28.
14. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machines Learning. 1989;Addison-Wesley, Reading, MA.
15. Gondim R.L.P. Genetic algorithms and the location area partitioning problem in cellular networks. Proceedings of the Vehicular Technology Conference 96, Atlanta, VA, April 29-30, May 1. 1996;1835-1838.
16. He L., Mort N. Hybrid genetic algorithms for telecommunications network back-up routing. BT Technology Journal. 18:(4):2000;42-50.
17. Holland J. Adaptation in Natural and Artificial Systems. 1975;The University of Michigan Press, Ann Arbor.
18. Houéto F., Pierre S. A tabu search approach for assigning cells to switches in cellular mobile networks. Computer Communications. 25:2002;464-477.
19. Kado K., Ross P., Come D. Eshelman L.J. A Study of Genetic Algorithms Hybrids for Facility Layout Problems, Proceedings Sixth International Conference on Genetic Algorithms. 1995;498-505 Morgan Kaufmann, San Mateo, CA.
20. Kleinrock L. Queuing Systems I: Theory. 1975;Wiley, New York.
21. Merchant A., Sengupta B. Assignment of cells to switches in PCS networks. IEEE/ACM Transactions on Networking. 3:(5):1995;521-526.
22. Merchant A., Sengupta B. Multiway graph partitioning with applications to PCS networks. IEEE Infocom'94. 2:1994;593-600.
23. Merz P., Freisleben B. Genetic local search for the tsp: new results. Proceedings IEEE International Conference on Evolutionary Computation, Piscataway, NJ. 1997;159-164.
24. Merz P., Freisleben B. Eiben A.-E., Back T., Schoenauer M., Schwefel H.P. Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem, Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature PPSN V. 1998;765-774 Springer, Berlin.
25. Mer-z P., Freisleben B. A comparison of memetic algorithms, tabu Search, and Ant Colonies for the quadratic assignment problem, Proceedings of the 1999 International Congress of Evolutionary Computation (CEC'99). 1999;IEEE Press, New York. pp. 2063-2070.
26. Merz P., Freislcben B. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation. 4:(4):2000;337-352.
27. P. Moscato, On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, Caltech Concurrent Computation Program, Technical Report. 826, California Institute of Technology, Pasadena, California, USA, 1989.
28. Moscato P., Norman M.G. Valero M., Onate E., Jane M., Larriba J.L., Suarez B. Memetic Approach for the Travelling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems, Parallel Computing and Transputer Applications. 1992;177-186 IOS Press, Amsterdam.
29. Olivier F. An evolutionary strategy for global minimization and its Markov chain analysis. IEEE Transactions on Evolutionary Computation. 2:(3):1998;77-90.
30. Rankin R., Wilkerson R., Harris G., Spring J. A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function. Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, Indianapolis, USA. 1993;251-256.
31. Reed D.P. The cost structure of personal communication services. IEEE Communications Magazine. 1993;102-108.
32. Saha D., Mukherjee A., Bhattacharjee P. A simple heuristic for assignment of cell to switches in a PCS network. Wireless Personal Communication. 12:2000;209-224.
33. Salomon R. Evolutionary algorithms and gradient search: similarities and differences. IEEE Transactions on Evolutionary Computation. 2:(2):1998;45-55.
34. Schenecke V., Vornberger O. Hybrid genetic algorithms for constrained placement problems. IEEE Transactions on Evolutionary Computation. 1:(4):1997;266-277.
35. Shigeyoshi T., Ashish G. Genetic algorithms with a robust solution searching scheme. IEEE Transactions on Evolutionary Computation. 1:(3):1997;201-208.
36. Turney P. Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of Artificial Intelligence Research. 2:1995;369-409.
37. Wheatly C. Trading coverage for capacity in cellular systems: a system perspective. Microwave Journal. 1995;62-79.