Predicting Speedups of Ideal Bounding Cases of Parallel Genetic Algorithms

Abstract

This paper presents models that predict the speedup of two cases that bound the possible topologies and migration rates of parallel genetic algorithms (GAs). The rst bounding case is a parallel GA with completely isolated demes or subpopulations. The model for this case shows that the speedup is not very signiicant as more demes are used. The second model… (More)

Topics

  • Presentations referencing similar topics