The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
The Equation for Response to Selection and Its Use for Prediction
Abstract
The Breeder Genetic Algorithm (BGA) was designed according to the theories and methods used in the science of livestock breeding. The prediction of a breeding experiment is based on the response to selection (RS) equation. This equation relates the change in a population's fitness to the standard deviation of its fitness, as well as to the parameters selection intensity and realized heritability. In this paper the exact RS equation is derived for proportionate selection given an infinite population in linkage equilibrium. In linkage equilibrium the genotype frequencies are the product of the univariate marginal frequencies. The equation contains Fisher's fundamental theorem of natural selection as an approximation. The theorem shows that the response is approximately equal to the quotient of a quantity called additive genetic variance, V A, and the average fitness. We compare Mendelian two-parent recombination with gene-pool recombination, which belongs to a special class of genetic algorithms that we call univariate marginal distribution (UMD) algorithms. UMD algorithms keep the genotypes in linkage equilibrium. For UMD algorithms, an exact RS equation is proven that can be used for long-term prediction. Empirical and theoretical evidence is provided that indicates that Mendelian two-parent recombination is also mainly exploiting the additive genetic variance. We compute an exact RS equation for binary tournament selection. It shows that the two classical methods for estimating realized heritability—the regression heritability and the heritability in the narrow sense—may give poor estimates. Furthermore, realized heritability for binary tournament selection can be very different from that of proportionate selection. The paper ends with a short survey about methods that extend standard genetic algorithms and UMD algorithms by detecting interacting variables in nonlinear fitness functions and using this information to sample new points.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Introduction to Quantitative Genetics.
Edwards, A. W. F., & Falconer, D. S. (1982) · Biometrics · doi:10.2307/2529912 · Cited by 21,447
The genetical theory of natural selection
Fisher, R. A. (1930) · doi:10.5962/bhl.title.27468 · Cited by 17,617
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
XV.—The Correlation between Relatives on the Supposition of Mendelian Inheritance.
Fisher, R. A. (1919) · Transactions of the Royal Society of Edinburgh · doi:10.1017/s0080456800012163 · Cited by 4,387
An introduction to population genetics theory
Crow, J. F., & Kimura, M. (1970) · Medical Entomology and Zoology · Cited by 4,223
Linear Statistical Inference and Its Applications.
Robertson, C. A., & Rao, C. R. (1975) · Biometrics · doi:10.2307/2529568 · Cited by 3,598
An Overview of Evolutionary Algorithms for Parameter Optimization
Bäck, T., & Schwefel, H.-P. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.1 · Cited by 2,111
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
Haldane, J. B. S. (1966) · Medical Entomology and Zoology · Cited by 1,299
From recombination of genes to the estimation of distributions I. Binary parameters
Mühlenbein, H., & Paaß, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_982 · Cited by 1,207
Self-citationPredictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
Self-citationBaum, L. E., & Eagon, J. A. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11751-8 · Cited by 1,036
Genetic Algorithms, Tournament Selection, and the Effects of Noise.
Miller, B. L., & Goldberg, D. E. (1995) · Cited by 962
The Mathematical Theory of Quantitative Genetics.
Bulmer, M. G. (1987) · Biometrics · doi:10.2307/2531982 · Cited by 781
A Comparison of Selection Schemes Used in Evolutionary Algorithms
Blickle, T., & Thiele, L. (1996) · Evolutionary Computation · doi:10.1162/evco.1996.4.4.361 · Cited by 590
Removing the Genetics from the Standard Genetic Algorithm
Baluja, S., & Caruana, R. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50014-1 · Cited by 573
MIMIC: Finding Optima by Estimating Probability Densities
Bonet, J. S. D., Isbell, C. L., & Viola, P. A. (1996) · Cited by 457
Feature subset selection by Bayesian networks: a comparison with genetic and sequential algorithms
Inza, I., Larrañaga, P., & Sierra, B. (2001) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(01)00038-x · Cited by 323
Genetic and statistical analyses of strong selection on polygenic traits: what, me normal?
Turelli, M., & Barton, N. H. (1994) · Genetics · doi:10.1093/genetics/138.3.913 · Cited by 289
On the Probability Theory of Linkage in Mendelian Heredity
Geiringer, H. (1944) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731313 · Cited by 274
Baluja, S., & Davies, S. (1997) · Cited by 261
The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.4.335 · Cited by 242
Self-citationAn interpretation and proof of the fundamental theorem of natural selection
Ewens, W. J. (1989) · Theoretical Population Biology · doi:10.1016/0040-5809(89)90028-2 · Cited by 210
The Schema Theorem and Price's Theorem
Altenberg, L. (1995) · Foundations of Genetic Algorithms · doi:10.1016/b978-1-55860-356-1.50006-6 · Cited by 198
Simulated Crossover in Genetic Algorithms
Syswerda, G. (1993) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-094832-4.50021-0 · Cited by 168
SOME APPLICATIONS OF MATHEMATICS TO BREEDING PROBLEMS
Robbins, R. B. (1917) · Genetics · doi:10.1093/genetics/2.5.489 · Cited by 130
Fuzzy Recombination for the Breeder Genetic Algorithm
Voigt, H.-M., Mühlenbein, H., & Cvetković, D. (1995) · Cited by 114
Self-citationSOME APPLICATIONS OF MATHEMATICS TO BREEDING PROBLEMS III
Robbins, R. B. (1918) · Genetics · doi:10.1093/genetics/3.4.375 · Cited by 103
Eshelman, L. J., & Schaffer, J. D. (1993) · international conference on Genetic algorithms · Cited by 97
Gene Pool Recombination in Genetic Algorithms
Mühlenbein, H., & Voigt, H.-M. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_4 · Cited by 89
Self-citationSimple Genetic Algorithms with Linear Fitness
Vose, M. D., & Wright, A. H. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.4.347 · Cited by 58
Generalized Convergence Models for Tournament- and (mu, lambda)-Selection
Bäck, T. (1995) · international conference on Genetic algorithms · Cited by 54
Error bounds for the fundamental and secondary theorems of natural selection.
Nagylaki, T. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.6.2402 · Cited by 29
SEARCH, blackbox optimization, and sample complexity
Kargupta, H., & Goldberg, D. E. (1996) · University of North Texas Digital Library (University of North Texas) · Cited by 24
Productive Recombination and Propagating and Preserving Schemata
Eshelman, L. J., & Schaffer, J. D. (1995) · Foundations of genetic algorithms · doi:10.1016/b978-1-55860-356-1.50018-2 · Cited by 21
Cited by
Lee, K. S., & Geem, Z. W. (2005) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2004.09.007 · Cited by 1,772
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
A Survey of Optimization by Building and Using Probabilistic Models
Pelikan, M., Goldberg, D. E., & Lobo, F. G. (2002) · Computational Optimization and Applications · doi:10.1023/a:1013500812258 · Cited by 750
Evolutionary dynamic optimization: A survey of the state of the art
Nguyen, T. T., Yang, S., & Branke, J. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.05.001 · Cited by 656
Feature subset selection by Bayesian networks: a comparison with genetic and sequential algorithms
Inza, I., Larrañaga, P., & Sierra, B. (2001) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(01)00038-x · Cited by 323
Metadata
- Authors
- Mühlenbein, H.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 1997-09
- Volume
- 5
- Issue
- 3
- Pages
- 303-346
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2139015486
- Cited by
- 512
- References
- 37
- FWCI
- 9.03
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.