This article presents an empirical study regarding the hypothesis that higher diversity in initial populations for Genetic Algorithms can reduce the number of iterations required to reach an optimum and potentially increase solution quality. We develop the empirical study using some theoretical functions addressed by other researchers such that the input to the Genetic Algorithm is populations of differing diversity. It is expected that the effort in analyzing the initial population with a diversity measure is going to be compensated for by reducing the number of iterations required and perhaps improving solution quality.
Pedro A. Diaz-Gomez, Dean F. Hougen