Constrained Coverage Optimisation for Mobile Cellular Networks
- 876 Downloads
This paper explores the use of evolutionary algorithms to optimise cellular coverage so as to balance the trafic load over the whole mobile cellular network. A transformation of the problem space is used to remove the principal power constraint. A problem with the intuitive transformation is shown and a revised transformation with much better performance is presented. This highlights a problem with transformationbased methods in evolutionary algorithms. While the aim of transformation is to speed convergence, a bad transformation can be counterproductive. A criterion that is necessary for successful transformations is explained. Using penalty functions to manage the constraints was investigated but gave poor results. The techniques described can be used as constraint-handling method for a wide range of constrained optimisations.
Unable to display preview. Download preview PDF.
- 1.T. Togo, I. Yoshii, and R. Kohno. Dynamic cell-size control according to geographical mobile distribution in a ds/cdma cellular system. In The Proceedings of the Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, volume 2, pages 677–681, 1998.Google Scholar
- 2.D.E. Goldberg. Genetic Algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, Massachusetts, 1989.Google Scholar
- 3.Raphael Dorne and Jin-Kao Hao. An evolutionary approach for frequency assignment in cellular radio networks. In The Proceedings of IEEE InternationalConference on Evolutionary Computation, volume 2, pages 539–544, Perth, WA,Australia, 1995.Google Scholar
- 5.D.E. Goldberg. The theory of virtual alphabets. In H.P. Schwefel and R. Manner, editors, Parallel Problem Solving from Nature, pages 13–22. Springer-Verlag, 1990.Google Scholar
- 6.Alden H. Wright. Genetic algorithms for real parameter optimization. In Gregory J. E. Rawlins, editor, Foundations of Genetic Algorithms, pages 205–218. Morgan Kaufman, 1991.Google Scholar
- 7.C.Z. Janikow and Z. Michalewicz. An experimental comparison of binary and floating point representations in genetic algorithms. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 31–36, 1991.Google Scholar
- 8.L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.Google Scholar
- 9.L.J. Eshelman and J.D. Schaffer. Real-coded algorithms and interval schemata. In L.D. Whitley, editor, Foundations of Genetic Algorithms, pages 187–202, 1993.Google Scholar
- 10.Z. Michalewicz and C.Z. Janikow. Handling constraints in genetic algorithms. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 151–157, 1991.Google Scholar
- 11.Carlos A. Coello Coello. A survey of constraint handling techniques used with evolutionary algorithms. Technical report, Lania-RI-99-04, Laboratorio Nacional de Informatica Avanzada, Veracruz, Mexico, 2000.Google Scholar
- 12.Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 135–155, Cambridge, Massachusetts, 1995. The MIT Press.Google Scholar