From Cells to Islands: An Unified Model of Cellular Parallel Genetic Algorithms
This paper presents the Anisotropic selection scheme for cellular Genetic Algorithms (cGA). This new scheme allows to enhance diversity and to control the selective pressure which are two important issues in Genetic Algorithms, especially when trying to solve difficult optimization problems. Varying the anisotropic degree of selection allows swapping from a cellular to an island model of parallel genetic algorithm. Measures of performances and diversity have been performed on one well-known problem: the Quadratic Assignment Problem which is known to be difficult to optimize. Experiences show that, tuning the anisotropic degree, we can find the accurate trade-off between cGA and island models to optimize performances of parallel evolutionary algorithms. This trade-off can be interpreted as the suitable degree of migration among subpopulations in a parallel Genetic Algorithm.
KeywordsGenetic Algorithm Migration Rate Good Individual Quadratic Assignment Problem Horizontal Diversity
Unable to display preview. Download preview PDF.
- 3.Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: FOGA, pp. 69–93 (1990)Google Scholar
- 4.Gorges-Schleuter, M.: Explicit parallelism of genetic algorithms through population structures. In: PPSN, pp. 150–159 (1991)Google Scholar
- 5.Jong, K.A.D., Sarma, J.: On decentralizing selection algorithms. In: ICGA, pp. 17–23 (1995)Google Scholar
- 7.Migkikh, V.V., Topchy, A.P., Kureichik, V.M., Tetelbaum, A.Y.: Combined genetic and local search algorithm for the quadratic assignment problemGoogle Scholar
- 8.Rudolph, G.: On takeover times in spatially structured populations: Array and ring. In: Proceedings of the SecondAsia-Pacific Conference on Genetic Algorithms and Applications (APGA 2000), pp. 144–151 (2000)Google Scholar
- 9.Spiessens, P., Manderick, B.: A massively parallel genetic algorithm: Implementation and first analysis. In: ICGA, pp. 279–287 (1991)Google Scholar
- 10.Sprave, J.: A unified model of non-panmictic population structures in evolutionary algorithms. Proceedings of the congress on Evolutionary computation 2, 1384–1391 (1999)Google Scholar