Sciweavers

GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 5 months ago
An analysis of multi-sampled issue and no-replacement tournament selection
Standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised i...
Huayang Xie, Mengjie Zhang, Peter Andreae, Mark Jo...
FOGA
1990
13 years 5 months ago
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, a...
David E. Goldberg, Kalyanmoy Deb
GECCO
2003
Springer
101views Optimization» more  GECCO 2003»
13 years 9 months ago
An Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem
This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the c...
Ying-Ping Chen, David E. Goldberg
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
13 years 10 months ago
Unbiased tournament selection
Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection...
Artem Sokolov, Darrell Whitley
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
13 years 10 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
CIMCA
2005
IEEE
13 years 10 months ago
Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms
This paper presents the comparison of performance on a simple genetic algorithm (SGA) using roulette wheel selection and tournament selection. A SGA is mainly composed of three ge...
Jinghui Zhong, Xiaomin Hu, Jun Zhang, Min Gu
CEC
2005
IEEE
13 years 10 months ago
Revisiting genetic selection in the XCS learning classifier system
The XCS Learning Classifier System has traditionally used roulette wheel selection within its genetic algorithm component. Recently, tournament selection has been suggested as prov...
Faten Kharbat, Larry Bull, Mohammed Odeh
GECCO
2007
Springer
117views Optimization» more  GECCO 2007»
13 years 10 months ago
Modeling selection pressure in XCS for proportionate and tournament selection
In this paper, we derive models of the selection pressure in XCS for proportionate (roulette wheel) selection and tournament selection. We show that these models can explain the e...
Albert Orriols-Puig, Kumara Sastry, Pier Luca Lanz...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
13 years 10 months ago
Another investigation on tournament selection: modelling and visualisation
Tournament selection has been widely used and studied in evolutionary algorithms. To supplement the study of tournament selection, this paper provides several models describing th...
Huayang Xie, Mengjie Zhang, Peter Andreae
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
13 years 10 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld