Master-Slave Parallel Genetic Algorithms

Master-slave parallel GAs are easy to implement, often yield considerable improvements in performance, and all the theory available for simple GAs can be used to choose adequate values for the search parameters. The analysis of this chapter showed that, for many applications, the reduction in computation time is sufficient to overcome the cost of communications. The calculations presented here should be useful to design fast master-slave GAs that utilize the computing resources in the best possible way.