Not-Sampled Issue and Round-Replacement Tournament
Selection
H. Xie, M. Zhang, and P. Andreae. Technical report, CS-TR-07-2. Computer Science, Victoria University of Wellington, New Zealand, (November 2007)
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 diversity. However, it is not clear how the
issue affects GP search. This paper uses a
round-replacement tournament selection to investigate
the importance of the issue. The theoretical and
experimental results show that although the issue can
be solved and the loss of diversity can be minimised
for small tournament sizes, the different selection
behaviour in the round-replacement tournament selection
cannot significantly improve the GP performance. The
not-sampled issue does not seriously affect the
selection performance in the standard tournament
selection.
%0 Report
%1 CS-TR-07-2
%A Xie, Huayang
%A Zhang, Mengjie
%A Andreae, Peter
%C New Zealand
%D 2007
%K algorithms, genetic programming, round-replacement selection selection, standard tournament
%N CS-TR-07-2
%T Not-Sampled Issue and Round-Replacement Tournament
Selection
%U http://www.mcs.vuw.ac.nz/comp/Publications/CS-TR-07-2.abs.html
%X 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 diversity. However, it is not clear how the
issue affects GP search. This paper uses a
round-replacement tournament selection to investigate
the importance of the issue. The theoretical and
experimental results show that although the issue can
be solved and the loss of diversity can be minimised
for small tournament sizes, the different selection
behaviour in the round-replacement tournament selection
cannot significantly improve the GP performance. The
not-sampled issue does not seriously affect the
selection performance in the standard tournament
selection.
@techreport{CS-TR-07-2,
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 diversity. However, it is not clear how the
issue affects GP search. This paper uses a
round-replacement tournament selection to investigate
the importance of the issue. The theoretical and
experimental results show that although the issue can
be solved and the loss of diversity can be minimised
for small tournament sizes, the different selection
behaviour in the round-replacement tournament selection
cannot significantly improve the GP performance. The
not-sampled issue does not seriously affect the
selection performance in the standard tournament
selection.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {New Zealand},
author = {Xie, Huayang and Zhang, Mengjie and Andreae, Peter},
biburl = {https://www.bibsonomy.org/bibtex/296b2977fae3593cfe55e10b4253bb118/brazovayeye},
institution = {Computer Science, Victoria University of Wellington},
interhash = {73415fe6986a7cbf09627e3fedd58378},
intrahash = {96b2977fae3593cfe55e10b4253bb118},
keywords = {algorithms, genetic programming, round-replacement selection selection, standard tournament},
month = {November},
number = {CS-TR-07-2},
size = {15 pages},
timestamp = {2008-06-19T17:54:37.000+0200},
title = {Not-Sampled Issue and Round-Replacement Tournament
Selection},
type = {Technical report},
url = {http://www.mcs.vuw.ac.nz/comp/Publications/CS-TR-07-2.abs.html},
year = 2007
}