Skip navigation
Skip navigation

Equivalence of probabilistic tournament and polynomial ranking selection

Hingee, Kassel; Hutter, Marcus

Description

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]

dc.contributor.authorHingee, Kassel
dc.contributor.authorHutter, Marcus
dc.date.accessioned2015-08-27T02:03:11Z
dc.date.available2015-08-27T02:03:11Z
dc.identifier.isbn978-1-4244-1822-0
dc.identifier.urihttp://hdl.handle.net/1885/15003
dc.description.abstractCrucial 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.publisherIEEE
dc.relation.ispartofIEEE World Congress on Computational Intelligence: Evolutionary Computation, 2008. CEC 2008
dc.rightsAuthors are free to post the accepted version of their articles on their personal Web sites or those of their employers. http://www.ieee.org/publications_standards/publications/rights/index.html as at 27/08/2015
dc.rights© 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works
dc.subjectevolutionary algorithms
dc.subjectranking selection
dc.subjecttournament selection
dc.subjectequivalence
dc.subjectefficiency
dc.titleEquivalence of probabilistic tournament and polynomial ranking selection
dc.typeConference paper
dc.date.issued2008-06
local.type.statusAccepted Version
local.contributor.affiliationHingee, K., Research School of Computer Science, The Australian National University
local.contributor.affiliationHutter, M., Research School of Computer Science, The Australian National University
local.bibliographicCitation.startpage564
local.bibliographicCitation.lastpage571
local.identifier.doi10.1109/CEC.2008.4630852
CollectionsANU Research Publications

Download

File Description SizeFormat Image
Hingee and Hutter Equivalence of Probabilistic Tournament 2008.pdf228.86 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator