Advertisement

From Cells to Islands: An Unified Model of Cellular Parallel Genetic Algorithms

  • David Simoncini
  • Philippe Collard
  • Sébastien Verel
  • Manuel Clergue
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4173)

Abstract

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.

Keywords

Genetic Algorithm Migration Rate Good Individual Quadratic Assignment Problem Horizontal Diversity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alba, E., Dorronsoro, B.: The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE transactions on Evolutionnary Computation 9, 126–142 (2005)CrossRefGoogle Scholar
  2. 2.
    Nugent, J.R.C.E., Vollman, T.E.: An experimental comparison of techniques for the assignment of techniques to locations. Operations Research 16, 150–173 (1968)CrossRefGoogle Scholar
  3. 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. 4.
    Gorges-Schleuter, M.: Explicit parallelism of genetic algorithms through population structures. In: PPSN, pp. 150–159 (1991)Google Scholar
  5. 5.
    Jong, K.A.D., Sarma, J.: On decentralizing selection algorithms. In: ICGA, pp. 17–23 (1995)Google Scholar
  6. 6.
    Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53–76 (1957)MATHCrossRefMathSciNetGoogle Scholar
  7. 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. 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. 9.
    Spiessens, P., Manderick, B.: A massively parallel genetic algorithm: Implementation and first analysis. In: ICGA, pp. 279–287 (1991)Google Scholar
  10. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • David Simoncini
    • 1
  • Philippe Collard
    • 1
  • Sébastien Verel
    • 1
  • Manuel Clergue
    • 1
  1. 1.Université Nice Sophia-Antipolis/CNRS 

Personalised recommendations