Population processing--a powerful class of parallel algorithms.
We present a model of optimization of cost functions by a population of parallel processors and argue that especially diploid recombination of gene strings is a promising recipe for optimization which nature proliferates. Based on a simulated evolutionary search strategy diploidy is introduced as a means for maintaining variability in computational problems with large numbers of local extrema. A differentiation into genotypes and phenotypes is performed. The applied strategy is compared to some traditional algorithms simulating evolution on the basis of two sample cost functions.
Banzhaf
W
W
Institut für theoretische Physik und Synergetik, Universität Stuttgart, F.R.G.
D000465:Algorithms; D005075:Biological Evolution; D003198:Computer Simulation; D004171:Diploidy; D005838:Genotype; D008954:Models, Biological; D010641:Phenotype; D011995:Recombination, Genetic