Editing Truncation selection (section)

== Computer science ==
In computer science, truncation selection is a [[selection (genetic algorithm)|selection method]] used in [[evolutionary algorithm]]s to select potential candidate solutions for recombination modeled after the breeding method.<ref>{{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}}</ref> 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.<ref>{{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}}</ref>