2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) 2008
DOI: 10.1109/cec.2008.4630852
|View full text |Cite
|
Sign up to set email alerts
|

Equivalence of probabilistic tournament and polynomial ranking selection

Abstract: Crucial to an Evolutionary Algorithm's performance is its selection scheme. We mathematically investigate the relation between polynomial rank and probabilistic tournament methods which are (respectively) generalisations of the popular linear ranking and tournament selection schemes. We show that every probabilistic tournament is equivalent to a unique polynomial rank scheme. In fact, we derived explicit operators for translating between these two types of selection. Of particular importance is that most linea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
4
2
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 7 publications
0
9
0
Order By: Relevance
“…Generally, the obtained objective function from the NLP sub‐problem must be considered. However, the method suggested in [31] is used here to replace the method based on assigning the penalty function to the problem. Using the binary tournament to select each parent by randomly selecting two players and afterwards, selecting the most desired individual among that sets as a parent (smaller fitness value) [32]. The child is also selected using two binary tournaments to generate a parent. Mating random pairs.…”
Section: Hybrid Icga‐nlp Algorithmmentioning
confidence: 99%
“…Generally, the obtained objective function from the NLP sub‐problem must be considered. However, the method suggested in [31] is used here to replace the method based on assigning the penalty function to the problem. Using the binary tournament to select each parent by randomly selecting two players and afterwards, selecting the most desired individual among that sets as a parent (smaller fitness value) [32]. The child is also selected using two binary tournaments to generate a parent. Mating random pairs.…”
Section: Hybrid Icga‐nlp Algorithmmentioning
confidence: 99%
“…Next, programs are selected for reproduction following the principle of Darwin's survival of the fittest. Selection methods for reproduction are numerous, but for this work, we briefly explain tournament selection [Hingee and Hutter 2008]. This method is a variant of rank-based selection methods, in which individuals are randomly selected and then ranked according to their relative fitness value, selecting the fittest among them for reproduction.…”
Section: Introductionmentioning
confidence: 99%
“…Mutation: Based on Grammar-Based Mutation (GBM)[73] and a variation of it of our own design, Schema Diversity Factor (SDF) mutation.• Probabilistic Tournament Selection[74] using the formula from[75].• Crossover: Whingham (WX) [70]. • Generational population replacement.…”
mentioning
confidence: 99%