PubMed · 2720140
Population processing--a powerful class of parallel algorithms.
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
W Banzhaf. 1989. Population processing--a powerful class of parallel algorithms.. https://doi.org/10.1016/0303-2647(89)90044-0. https://searchpubmed.org/record/pubmed%3A2720140/population-processing-a-powerful-class-of-parallel-algorithms
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search PubMed by Indiciae: BibTeX · RIS.