Equivalence of Probabilistic Tournament and Polynomial Ranking Selection

Simple item page
dc.creatorHingee, Kassel
dc.creatorHutter, Marcus
dc.date2008-03-20
dc.date.accessioned2026-07-07T09:46:32Z
dc.date.available2026-07-07T09:46:32Z
dc.descriptionCrucial 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.
dc.description9 double-column pages, 5 figures
dc.identifierhttps://arxiv.org/abs/0803.2925
dc.identifierhttp://arxiv.org/abs/0803.2925
dc.identifierProc. 2008 Congress on Evolutionary Computation (CEC 2008) pages 564-571
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163562
dc.subjectNeural and Evolutionary Computing
dc.titleEquivalence of Probabilistic Tournament and Polynomial Ranking Selection
dc.typetext

Files

Collections

arXiv