Truncation selection

{{short description|Method of selection in selective breeding}}

{{Evolutionary algorithms}}

Truncation selection is a selection method in selective breeding and in evolutionary algorithms from computer science, which selects a certain share of fittest individuals from a population for reproduction in the next generation.

Animal and plant breeding

In animal and plant breeding, truncation selection is a standard method. Animals are ranked by their phenotypic value on some trait such as milk production, and the top percentage is reproduced. The effects of truncation selection for a continuous trait can be modeled by the standard breeder's equation by using heritability and truncated normal distributions. On a binary trait, it can be modeled easily using the liability threshold model. It is considered an easy and efficient method of breeding.Crow & Kimura 1979, [https://www.ncbi.nlm.nih.gov/pmc/articles/PMC382946/ "Efficiency of truncation selection"]

Computer science

In computer science, truncation selection is a selection method used in evolutionary algorithms to select potential candidate solutions for recombination modeled after the breeding method.{{cite journal |last1=Blickle |first1=Tobias |last2=Thiele |first2=Lothar |title=A Comparison of Selection Schemes Used in Evolutionary Algorithms |journal=Evolutionary Computation |date=December 1996 |volume=4 |issue=4 |pages=361–394 |doi=10.1162/evco.1996.4.4.361}} In truncation selection the candidate solutions are ordered by fitness, and some proportion T% of the top fittest individuals are selected and reproduced randomly. It is used in Muhlenbein's breeder genetic algorithm.{{cite journal|

journal=Evolutionary Computation|

year=1993|

title=Predictive Models for the Breeder Genetic Algorithm|

author=H Muhlenbein, D Schlierkamp-Voosen|

url=http://citeseer.comp.nus.edu.sg/rd/0,730860,1,0.25,Download/http:qSqqSqwww.ais.fraunhofer.deqSq%257EmuehlenqSqpublicationsqSqgmd_as_ga-93_01.ps|

doi=10.1162/evco.1993.1.1.25|

s2cid=16085506|

url-access=subscription}}

References

{{reflist}}