Equivalence of probabilistic tournament and polynomial ranking selection
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...[Show more]
|Collections||ANU Research Publications|
|Hingee and Hutter Equivalence of Probabilistic Tournament 2008.pdf||228.86 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.