Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)
The influence of migration sizes and intervals on island models
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the scalability of parallel genetic algorithms
Evolutionary Computation
Statistical analysis for evolutionary computation: introduction
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
The benefit of migration in parallel evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Homogeneous and heterogeneous island models for the set cover problem
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
| Hi-index | 0.00 |
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.