Truncation selection
From Wikipedia, the free encyclopedia
Truncation selection is a selection method used in genetic algorithms to select potential candidate solutions for recombination.
In truncation selection the candidate solutions are ordered by fitness, and some proportion, p, (e.g. p=1/2, 1/3, etc.), of the fittest individuals are selected and reproduced 1/p times. Truncation selection is less sophisticated than many other selection methods, and is not often used in practice. It is used in Muhlenbein's Breeder Genetic Algorithm.[1]
[edit] References
- ^ H Muhlenbein, D Schlierkamp-Voosen (1993). "Predictive Models for the Breeder Genetic Algorithm". Evolutionary Computation. http://citeseer.comp.nus.edu.sg/rd/0,730860,1,0.25,Download/http:qSqqSqwww.ais.fraunhofer.deqSq%257EmuehlenqSqpublicationsqSqgmd_as_ga-93_01.ps.
 |
This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it. |
|
This computer science article is a stub. You can help Wikipedia by expanding it. |
  |
This bioinformatics-related article is a stub. You can help Wikipedia by expanding it. |
