Hierarchical Cellular Genetic Algorithm
Cellular Genetic Algorithms (cGA) are spatially distributed Genetic Algorithms that, because of their high level of diversity, are superior to regular GAs on several optimization functions. Also, since these distributed algorithms only require communication between few closely arranged individuals, they are very suitable for a parallel implementation. We propose a new kind of cGA, called hierarchical cGA (H-cGA), where the population structure is augmented with a hierarchy according to the current fitness of the individuals. Better individuals are moved towards the center of the grid, so that high quality solutions are exploited quickly, while at the same time new solutions are provided by individuals at the outside that keep exploring the search space. This algorithmic variant is expected to increase the convergence speed of the cGA algorithm and maintain the diversity given by the distributed layout. We examine the effect of the introduced hierarchy by observing the variable takeover rates at different hierarchy levels and we compare the H-cGA to the cGA algorithm on a set of benchmark problems and show that the new approach performs promising.
KeywordsGenetic Algorithm Convergence Speed Good Individual Hierarchy Level Quadratic Growth
Unable to display preview. Download preview PDF.
- 1.Manderick, B., Spiessens, P.: Fine-grained parallel genetic algorithm. In: Schaffer, J. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 428–433. Morgan Kaufmann, San Francisco (1989)Google Scholar
- 7.Goldberg, D., Deb, K.: Foundations of Genetic Algorithms. In: A comparative analysis of selection scheme used in genetic algorithms, pp. 69–93. Morgan Kaufmann Publishers, San Francisco (1991)Google Scholar
- 9.Schaffer, J., Eshelman, L.: On crossover as an evolutionary viable strategy. In: 4th ICGA, pp. 61–68. Morgan Kaufmann, San Francisco (1991)Google Scholar
- 10.Goldberg, D., Deb, K., Horn, J.: Massively multimodality, deception and genetic algorithms. In: Proc. of the PPSN-2, pp. 37–46. North-Holland, Amsterdam (1992)Google Scholar
- 11.Jong, K.D., Potter, M., Spears, W.: Using problem generators to explore the effects of epistasis. In: 7th ICGA, pp. 338–345. Morgan Kaufmann, San Francisco (1997)Google Scholar
- 12.Stinson, D.: An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Winnipeg, Manitoba, Canada (1985) (2nd edn., 1987)Google Scholar
- 13.S.K., Bäck, T., Heitkötter, J.: An evolutionary approach to combinatorial optimization problems. In: Proceedings of the 22nd annual ACM computer science conference (CSC 1994), pp. 66–73. ACM Press, New York (1994)Google Scholar