A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Analysis of selection, mutation and recombination in genetic algorithms
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
Genetic algorithms have been applied fairly successful to a number of optimization problems. Nevertheless, a common theory why and when they work is still missing. In this paper a theory is outlined which is based on the science of plant and animal breeding. A central part of the theory is the response to selection equation and the concept of heritability. A fundamental theorem states that the heritability is equal to the regression coe cient of parent to o spring. The theory is applied to
doi:10.1007/3-540-59046-3_9
fatcat:m432s4nmtvhrdgag23n5kat3oe