DocumentCode
2918370
Title
Is the not-sampled issue in tournament selection critical?
Author
Xie, Huayang ; Zhang, Mengjie ; Andreae, Peter ; Johnston, Mark
Author_Institution
Sch. of Math., Victoria Univ. of Wellington, Wellington
fYear
2008
fDate
1-6 June 2008
Firstpage
3710
Lastpage
3717
Abstract
The standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised issues is that it is possible to have some individuals not sampled at all during the selection phase. The not-sampled issue aggravates the loss of program diversity. However, it is not clear how the issue affects genetic programming (GP) search. This paper investigates the importance of the issue. The theoretical and experimental results show that the issue can be solved and the loss of diversity contributed by not-sampled individuals can be minimised. However, doing so does not appears to significantly improve a GP system. Our conclusion is that the not-sampled issue does not seriously affect the selection performance in the standard tournament selection.
Keywords
genetic algorithms; sampling methods; genetic programming search; not-sampled issue; parent selection schemes; program diversity; sampling-with-replacement strategy; tournament selection; Code standards; Computer science; Evolutionary computation; Genetic programming; Mathematics; Parallel architectures; Pressure measurement; Probability; Standards development; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-1822-0
Electronic_ISBN
978-1-4244-1823-7
Type
conf
DOI
10.1109/CEC.2008.4631300
Filename
4631300
Link To Document