A grouping genetic algorithm for registration area planning

Apurva K, Umesh MN, Jha R. Mobility modeling of rush hour traffic for location area design in cellular networks. In: Proceedings of the Third ACM International Workshop on Wireless Mobile Multimedia. Boston, MA; 2000. p. 48–54. Demirkol, 2004, Location area planning and cell-to-switch assignment in cellular networks, IEEE Transactions on Wireless Communications, 3, 880, 10.1109/TWC.2004.827767 Demirkol I, Ersoy C, Caglayan MU, Delic H. Location area planning in cellular networks using simulated annealing. In: Proceedings of the 23rd Conference of the IEEE Communications Society. Anchorage, AK; 2001. p. 13–20. Wang, 1998, Registration area planning for PCS networks using genetic algorithms, IEEE Transactions on Vehicular Technology, 47, 987, 10.1109/25.704853 Garey, 1979 Bejerano Y, Cidon I. Efficient location management based on moving location areas. In: Proceedings of the 23rd Conference of the IEEE Communications Society. Anchorage, AK; 2001. p. 3–12. Demestichas P, Tzifa E, Demesticha V, Georgantas N, Kotsakis G, Kilanioti M, Striki M, Anagnostou ME, Theologou ME. Control of the location update and paging signaling load in cellular systems by means of planning tools. In: Proceedings of the IEEE 50th Vehicular Technology Conference. Amsterdam; 1999. p. 2119–23. Gamst A. Application of graph theoretical methods to GSM radio network planning. In: Proceedings of the IEEE Symposium on Circuits and Systems. Sydney, Australia, 1991. p. 942–5. Gondim PRL. Genetic algorithms and the location area partition problem in cellular networks. In: Proceedings of the IEEE 46th Vehicular Technology Conference. Atlanta, GA; 1996. p. 1835–8. Markoulidakis, 1993, Method for efficient location area planning in mobile telecommunications, Electronics Letters, 29, 2165, 10.1049/el:19931453 Plehn J. The design of location areas in a GSM-network. In: Proceedings of the IEEE 45th Vehicular Technology Conference, vol. 2. Chicago, IL; 1995. p. 871–5. Saraydar CU, Rose C. Location area design using population and traffic data. In: Proceedings of the 32nd Annual Conference on Information Science and Systems. Princeton, NJ; 1998. p. 739–44. Merchant, 1995, Assignment of cells to switches in PCS networks, IEEE/ACM Transactions on Networking, 3, 521, 10.1109/90.469954 Joines JA, Houck CR, On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs. In: Fogel D, Michalewicz Z, editors. Proceedings of 1994 IEEE Conference on Evolutionary Computation. Piscataway, New Jersey, 1994. p. 579–85. Richardson JT, Palmer MR, Liepins G, Hilliard M. Some guidelines for genetic algorithms with penalty functions. In: David Schaffer J, editor. Proceedings of the Third International Conference on Genetic Algorithms. Fairfax, Virginia, USA: 1989. p. 191–7. Bejerano Y, Cidon I. An efficient mobility management strategy for personal communication systems. In: Proceedings of the Fourth Annual International Conference on Mobile Computing and Networking. Dallas, TX; 1998. p. 215–22. Biesterfeld J, Jobmann K. The use of prediction areas to improve mobility management algorithms. In: Proceedings of the International Conference on Telecommunications, vol. 4. Chaldiki; 1998. p. 446–50. Bhattacharjee PS, Saha D, Mukherjee A. Intelligent paging strategies for personal communication services network. In: Proceedings of the International Workshop on Data Engineering for Wireless and Mobile Access. Seattle, WA; 1999. p. 36–43. Bhattacharjee PS, Saha D, Mukherjee A, Maitra M. Location area planning for personal communication services networks. In: Proceedings of Second ACM International Workshop on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. Seattle, WA; 1999. p. 95–8. Wan, 1999, Cost reduction in location management using semi-realtime movement information, Wireless Networks, 5, 245, 10.1023/A:1019155212541 Bejerano Y, Immorlica N, Naor J, Smith M. Efficient location area planning for personal communication systems. In: Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking. San Diego, CA; 2003. p. 109–21. Kunz, 2001, The peril of evaluating location management proposals through simulations, Wireless Networks, 7, 635, 10.1023/A:1012375503129 Escalle, 2002, Reducing location update and paging costs in a PCS network, IEEE Transactions on Wireless Communications, 1, 200, 10.1109/7693.975458 Akyildiz, 1999, Mobility management in next-generation wireless systems, Proceedings of the IEEE, 87, 1347, 10.1109/5.775420 Holland, 1975 Goldberg, 1989 Michalewicz, 1994 Falkenauer, 1993, The grouping genetic algorithms, JORBEL: Belgian Journal of Operations Research, Statistics and Computer Science, 33, 79 Falkenauer, 1998 Brown, 2001, CF-GGA, International Journal of Production Research, 39, 3651, 10.1080/00207540110068781 Brown EC, Sumichrast RT. Evaluating performance advantages of grouping genetic algorithms. Engineering Applications of Artificial Intelligence 2005;18(1):1–12. Eiben, 1998, Graph coloring with adaptive evolutionary algorithms, Journal of Heuristics, 4, 25, 10.1023/A:1009638304510 Falkenauer E, Delchambre A. A genetic algorithm for bin packing and line balancing. In: Proceedings of the IEEE 1992 International Conference on Robotics and Automation. Nice, France; 1992. p. 1186–92. Falkenauer, 1996, A hybrid grouping genetic algorithm for bin packing, Journal of Heuristics, 2, 5, 10.1007/BF00226291 Kreng, 2004, Modular product design with grouping genetic algorithm—a case study, Computers and Industrial Engineering, 46, 443, 10.1016/j.cie.2004.01.007 Shu L, Schaeffer J. Improving the performance of genetic algorithm learning by choosing a good initial population. Technical report no. TR90-22, University of Alberta, Edmonton, Department of Computer Science, 1990. Yang CH, Nygard KE. The effects of initial population in genetic search for time constrained traveling salesman problems. In: Proceedings of the ACM Computer Science Conference. New York; 1993. p. 378–83. Reeves, 1995, A genetic algorithm for flowshop sequencing, Computers and Operations Research, 22, 5, 10.1016/0305-0548(93)E0014-K Radcliffe NJ. Forma analysis and random respectful combination. In: Proceedings of the Fourth International Conference on Genetic Algorithms. San Diego, CA; 1991. p. 222–9. Lin, 1994, Eliminating the boundary effect of a large-scale personal communication service network simulation, ACM Transactions on Modeling and Computer Simulation, 4, 165, 10.1145/175007.175012