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 - http://www.scopus.com/inward/record.url?scp=55749086384&partnerID=8YFLogxK
U2 - 10.1109/CEC.2008.4630852
DO - 10.1109/CEC.2008.4630852
M3 - Conference contribution
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 -