Experimental Supplements to the Theoretical Analysis of Migration in the Island Model

  • Jörg Lässig
  • Dirk Sudholt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6238)


In Lässig and Sudholt (GECCO 2010) the first running time analysis of a non-trivial parallel evolutionary algorithm was presented. It was demonstrated for a constructed function that an island model with migration can drastically outperform both panmictic EAs as well as parallel EAs without migration. This work provides additional empirical results that increase our understanding of why and when migration is essential for this function. We provide empirical evidence complementing the theoretical results, investigate the robustness with respect to the choice of the migration interval and compare various migration topologies using statistical tests.


Global Optimum Success Probability Good Individual Experimental Supplement Island Model 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alba, E.: Parallel evolutionary algorithms can achieve super-linear performance. Information Processing Letters 82(1), 7–13 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    He, J., Yao, X.: Analysis of scalable parallel evolutionary algorithms. In: Proceedings of CEC 2006, pp. 120–127 (2006)Google Scholar
  3. 3.
    Cantú-Paz, E., Goldberg, D.E.: On the scalability of parallel genetic algorithms. Evolutionary Computation 7(4), 429–449 (1999)CrossRefGoogle Scholar
  4. 4.
    Tomassini, M.: Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  5. 5.
    Skolicki, Z., De Jong, K.: The influence of migration sizes and intervals on island models. In: Proceedings of GECCO 2005, pp. 1295–1302. ACM, New York (2005)Google Scholar
  6. 6.
    Lässig, J., Sudholt, D.: The benefit of migration in parallel evolutionary algorithms. In: Proceedings of GECCO 2010, pp. 1105–1112. ACM, New York (2010)Google Scholar
  7. 7.
    Wineberg, M., Christensen, S.: Statistical analysis for evolutionary computation: introduction. In: Companion of GECCO 2009, pp. 2949–2976. ACM, New York (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jörg Lässig
    • 1
  • Dirk Sudholt
    • 1
  1. 1.International Computer Science InstituteBerkeleyUSA

Personalised recommendations