The equation for response to selection and its use for prediction

Evolutionary Computation

Volumn 5, Issue 3, 1997, Pages 303-346

  Mühlenbein, Heinz ^a  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

Fisher's theorem; Heritability; Linkage equilibrium; Response to selection; Robbins' proportions; Selection intensity; Tournament selection; Univariate marginal distributions

Indexed keywords

ALGORITHM; ALLELE; ANIMAL; ANIMAL HUSBANDRY; ARTICLE; BIOLOGICAL MODEL; EVOLUTION; FEMALE; GENETIC LINKAGE; GENETIC RECOMBINATION; GENETIC SELECTION; MALE; REGRESSION ANALYSIS;

ALGORITHMS; ALLELES; ANIMAL HUSBANDRY; ANIMALS; EVOLUTION; FEMALE; LINKAGE (GENETICS); MALE; MODELS, GENETIC; RECOMBINATION, GENETIC; REGRESSION ANALYSIS; SELECTION (GENETICS);

EID: 0031215849     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/evco.1997.5.3.303     Document Type: Article

References (12)

1. Aarts, E., & Korts, J. (1989). Simulated annealing and Boltzmann machines. New York: Wiley.
2. Altenberg, L. (1995). The schema theorem and Price's theorem. In L. D. Whitley & M. D. Vose (Eds.), Foundations of genetic algorithms 3 (pp. 23-50). San Francisco: Morgan Kaufmann.
3. Arnold, B. C., Balakrishnan, N., & Nagaraja, H. N. (1992). A first course in order statistics. New York: Wiley.
4. Asoh, H., & Mühlenbein, H. (1994a). Estimating the heritability by decomposing the genetic variance. In Y. Davidor, H.-P. Schwefel, & R. Männer (Eds.), Parallel problem solving from nature [Lecture Notes in Computer Science 866] (pp. 98-107). New York: Springer-Verlag.
5. Asoh, H., & Mühlenbein, H. (1994b). On the mean convergence time of evolutionary algorithms without selection and mutation. In Y. Davidor, H.-P. Schwefel, & R. Männer (Eds.), Parallel problem solving from nature [Lecture Notes in Computer Science 866] (pp. 88-97). New York: Springer-Verlag.
6. Bäck, T. (1995). Generalized convergence models for tournament and (μ, λ) selection. In L. Eshelman (Ed.), Sixth International Conference on Genetic Algorithms (pp. 2-8). San Francisco: Morgan Kaufmann.
7. Bäck, T., & Schwefel, H.-P. (1993). An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1, 1-24.
8. Baluja, S., & Caruana, R. (1995). Removing the genetics from the standard genetic algorithm. In Proceedings of the 12th International Conference on Machine Learning, Lake Tahoe. San Francisco: Morgan Kaufmann.
9. Baluja, S., & Davies, S. (1997). Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space (Report No. CS-9-107). Pittsburgh, PA: Carnegie Mellon University.
10. Baum, L. E., & Eagon, J. A. (1967). An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bulletin of the American Mathematical Society, 73, 360-363.
11. Besag, J. (1974). Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society, Series B, Vol. 36, 192-236.
12. Blickle, T., & Thiele, L. (1997). A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4, 361-394.