On optimal population size of genetic algorithms
Jarmo T. Alander · 2003
A description is given of the results of experiments to find the optimum population size for genetic algorithms as a function of problem complexity. It seems that for moderate problem complexity the optimal population size for problems coded as bitstrings is approximately the length of the string in bits for sequential machines. This result is also consistent with earlier experimentation. In parallel architectures the optimal population size is larger than in the corresponding sequential cases, but the exact figures seem to be sensitive to implementation details.>