2003 · 209 citations · 5 references
ComputingComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingAlgorithm AnalysisAlgorithmic ComplexityComputational ComplexityEvolutionary ComputationEvolutionary OptimizationGenetic AlgorithmsComplexityOptimal Population SizeParallel Computing ArchitecturesParallel Evolutionary ComputationParallel Genetic AlgorithmsPopulation SizePopulation-based OptimizationSequential Machines
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
5
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
D. E. Goldberg · Medical Entomology and Zoology · 1989 · 10.1K citations
Russell Jones · Data Processing · 1985 · 558 citations