A grouping genetic algorithm for registration area planning

Omega

Volumn 34, Issue 3, 2006, Pages 220-230

  Vroblefski, Mark ^a   Brown, Evelyn C ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Artificial intelligence; Heuristics; Stochastic programming; Telecommunications

Indexed keywords

EID: 27744453968     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2004.10.005     Document Type: Article

References (40)

1. 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.
2. I. Demirkol C. Ersoy M.U. Caglayan H. Delic Location area planning and cell-to-switch assignment in cellular networks IEEE Transactions on Wireless Communications 3 3 2004 880-90
3. 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.
4. T. Wang S. Hwang C. Tseng Registration area planning for PCS networks using genetic algorithms IEEE Transactions on Vehicular Technology 47 3 1998 987-94
5. M.R. Garey D.S. Johnson Computers and intractability, a guide to the theory of NP completeness 1979 W.H. Freeman and Company New York
6. 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.
7. 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.
8. 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.
9. 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.
10. J.G. Markoulidakis E.D. Sykas Method for efficient location area planning in mobile telecommunications Electronics Letters 29 1993 2165-6
11. 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.
12. 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.
13. A. Merchant B. Sengupta Assignment of cells to switches in PCS networks IEEE/ACM Transactions on Networking 3 5 1995 521-6
14. 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.
15. 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.
16. 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.
17. 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.
18. 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.
19. 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.
20. G. Wan E. Lin Cost reduction in location management using semi-realtime movement information Wireless Networks 5 1999 245-56
21. 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.
22. T. Kunz A.A. Siddiqi J. Scourias The peril of evaluating location management proposals through simulations Wireless Networks 7 2001 635-43
23. P.G. Escalle V.C. Giner J.M. Oltra Reducing location update and paging costs in a PCS network IEEE Transactions on Wireless Communications 1 1 2002 200-9
24. I.F. Akyildiz J. McNair J.S.M. Ho H. Uzunalioglu W. Wang Mobility management in next-generation wireless systems Proceedings of the IEEE 87 8 1999 1347-85
25. J.H. Holland Adaptation in natural and artificial systems: An introductory analysis with applications in biology, control, and artificial intelligence 1975 University of Michigan Press Ann Arbor, MI
26. D. Goldberg Genetic algorithms in search, optimization, and machine learning 1989 Addison-Wesley Reading, MA
27. Z. Michalewicz Genetic algorithms + data structures = evolution programs 1994 Springer New York
28. E. Falkenauer The grouping genetic algorithms: Widening the scope of the GAs JORBEL: Belgian Journal of Operations Research, Statistics and Computer Science 33 1993 79-102
29. E. Falkenauer Genetic algorithms for grouping problems 1998 Wiley New York
30. E.C. Brown R.T. Sumichrast CF-GGA: A grouping genetic algorithm for the cell formation problem International Journal of Production Research 39 16 2001 3651-69
31. Brown EC, Sumichrast RT. Evaluating performance advantages of grouping genetic algorithms. Engineering Applications of Artificial Intelligence 2005;18(1):1-12.
32. A.E. Eiben J.K. Van Der Hauw J.I. Van Hemert Graph coloring with adaptive evolutionary algorithms Journal of Heuristics 4 1 1998 25-46
33. 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.
34. E. Falkenauer A hybrid grouping genetic algorithm for bin packing Journal of Heuristics 2 1 1996 5-30
35. V.B. Kreng T.P. Lee Modular product design with grouping genetic algorithm - a case study Computers and Industrial Engineering 46 2004 443-60
36. 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.
37. 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.
38. C.R. Reeves A genetic algorithm for flowshop sequencing Computers and Operations Research 22 1995 5-13
39. Radcliffe NJ. Forma analysis and random respectful combination. In: Proceedings of the Fourth International Conference on Genetic Algorithms. San Diego, CA; 1991. p. 222-229.
40. Y.B. Lin V.W. Mak Eliminating the boundary effect of a large-scale personal communication service network simulation ACM Transactions on Modeling and Computer Simulation 4 1994 165-90