Bounding Cases of Genetic Algorithms with Multiple Demes

The calculations presented in this chapter recognize that the design of parallel GAs is a complex problem, and that the choices of topologies, migration rates, number of demes, and their size are intimately related. To make progress on the deme-sizing problem without ignoring the other choices, the analysis used bounds on the topologies and migration rates.