On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)
Parallel Evolutionary Computations (Studies in Computational Intelligence)
Parallel Evolutionary Computations (Studies in Computational Intelligence)
The benefit of migration in parallel evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Adaptive population models for offspring populations and parallel evolutionary algorithms
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Effect of topology on diversity of spatially-structured evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
On the effectiveness of crossover for migration in parallel evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
DAMS: distributed adaptive metaheuristic selection
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Fitness-levels for non-elitist populations
Proceedings of the 13th 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
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
Runtime analysis of convex evolutionary search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Crossover speeds up building-block assembly
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The choice of the offspring population size in the (1,λ) EA
Proceedings of the 14th annual conference on Genetic and evolutionary 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
| Hi-index | 0.00 |
We present new methods for the running time analysis of parallel evolutionary algorithms with spatially structured populations. These methods are applied to estimate the speed-up gained by parallelization in pseudo-Boolean optimization. The possible speed-up increases with the density of the topology. Surprisingly, even sparse topologies like ring graphs lead to a significant speed-up for many functions while not increasing the total number of function evaluations. We also give practical hints towards choosing the minimum number of processors that gives an optimal speed-up.