Equivalence of probabilistic tournament and polynomial ranking selection

Kassel Hingee; Marcus Hutter

doi:10.1109/CEC.2008.4630852

Equivalence of probabilistic tournament and polynomial ranking selection

Kassel Hingee^*, Marcus Hutter

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › peer-review

12 Citations (Scopus)

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 linear and most practical quadratic rank schemes are probabilistic tournaments.

Original language	English
Title of host publication	2008 IEEE Congress on Evolutionary Computation, CEC 2008
Pages	564-571
Number of pages	8
DOIs	https://doi.org/10.1109/CEC.2008.4630852
Publication status	Published - 2008
Event	2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong, China Duration: 1 Jun 2008 → 6 Jun 2008

Publication series

Name	2008 IEEE Congress on Evolutionary Computation, CEC 2008

Conference

Conference	2008 IEEE Congress on Evolutionary Computation, CEC 2008
Country/Territory	China
City	Hong Kong
Period	1/06/08 → 6/06/08

Access to Document

10.1109/CEC.2008.4630852

Cite this

@inproceedings{d29f1b1f685744d79ddfb4155e75bd2c,

title = "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 linear and most practical quadratic rank schemes are probabilistic tournaments.",

author = "Kassel Hingee and Marcus Hutter",

year = "2008",

doi = "10.1109/CEC.2008.4630852",

language = "English",

isbn = "9781424418237",

series = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

pages = "564--571",

booktitle = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

note = "2008 IEEE Congress on Evolutionary Computation, CEC 2008 ; Conference date: 01-06-2008 Through 06-06-2008",

}

TY - GEN

T1 - Equivalence of probabilistic tournament and polynomial ranking selection

AU - Hingee, Kassel

AU - Hutter, Marcus

PY - 2008

Y1 - 2008

N2 - 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 linear and most practical quadratic rank schemes are probabilistic tournaments.

AB - 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 linear and most practical quadratic rank schemes are probabilistic tournaments.

UR - https://www.scopus.com/pages/publications/55749086384

U2 - 10.1109/CEC.2008.4630852

DO - 10.1109/CEC.2008.4630852

M3 - Conference Paper

SN - 9781424418237

T3 - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

SP - 564

EP - 571

BT - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

T2 - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

Y2 - 1 June 2008 through 6 June 2008

ER -

Equivalence of probabilistic tournament and polynomial ranking selection

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this