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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
The Bivariate Marginal Distribution Algorithm
Pelikan, M., & Muehlenbein, H. (1999) · Advances in Soft Computing · doi:10.1007/978-1-4471-0819-1_39 · Cited by 321
Linkage Problem, Distribution Estimation, and Bayesian Networks
Pelikan, M., Goldberg, D. E., & Cantú-Paz, E. (2000) · Evolutionary Computation · doi:10.1162/106365600750078808 · Cited by 314
Schemata, Distributions and Graphical Models in Evolutionary Optimization
Mühlenbein, H., Mahnig, T., & Rodriguez, A. O. (1999) · Journal of Heuristics · doi:10.1023/a:1009689913453 · Cited by 299
Self-citationQuantum-inspired evolutionary algorithms: a survey and empirical study
Zhang, G. (2011) · Journal of Heuristics · doi:10.1007/s10732-010-9136-0 · Cited by 295
FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions
Mühlenbein, H., & Mahnig, T. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.4.353 · Cited by 288
Self-citationA location-based incentive mechanism for participatory sensing systems with budget constraints
Jaimes, L. G., Vergara-Laurens, I., & Labrador, M. A. (2012) · 2012 IEEE International Conference on Pervasive Computing and Communications · doi:10.1109/percom.2012.6199855 · Cited by 256
A Review on Estimation of Distribution Algorithms
Larrañaga, P. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-1539-5_3 · Cited by 100
Arruti, A., Cearreta, I., Álvarez, A., Lazkano, E., & Sierra, B. (2014) · PLoS ONE · doi:10.1371/journal.pone.0108975 · Cited by 21
“Population Based Incremental Learning (PBIL) [69], Compact Genetic Algorithm (cGA) [70] and Univariate Marginal Distribution Algorithm (UMDA) [71] are three algorithms of this type.”
Method
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.