A theoretical investigation of a parallel genetic algorithm
Chrisila C. Pettey, Michael R. Leuze · international conference on Genetic algorithms · 1989
In the past few years the limitations of uniprocessor computing systems and the increasing availability of multiprocessors have led to investigations of parallel genetic algorithms. One algorithm in particular, called PGA, consists of a set of communicating sequential genetic algorithms. This paper includes an investigation of the theoretical allocation of trials to schemata by PGA's in general and by a particular PGA (which performs communication in a uniformly random manner) along with an experimental validation of an assumption made in the theoretical investigation. 17 refs., 4 figs.