Not-Sampled Issue and Round-Replacement Tournament Selection

Created by W.Langdon from gp-bibliography.bib Revision:1.4496

  author =       "Huayang Xie and Mengjie Zhang and Peter Andreae",
  title =        "Not-Sampled Issue and Round-Replacement Tournament
  institution =  "Computer Science, Victoria University of Wellington",
  year =         "2007",
  type =         "Technical report",
  number =       "CS-TR-07-2",
  address =      "New Zealand",
  month =        nov,
  keywords =     "genetic algorithms, genetic programming, tournament
                 selection, standard tournament selection,
                 round-replacement tournament selection",
  URL =          "",
  URL =          "",
  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
  size =         "15 pages",

Genetic Programming entries for Huayang Jason Xie Mengjie Zhang Peter Andreae