Equivalence of Probabilistic Tournament and Polynomial Ranking Selection

Details Equivalence of Probabilistic Tournament and Polynomial Ranking Selection Equivalence of Probabilistic Tournament and Polynomial Ranking Selection

2008-03-20

arxiv.org/abs/0803.2925v1

Proc. 2008 Congress on Evolutionary Computation (CEC 2008) pages 564-571

Computer Science

Neural and Evolutionary Computing

9 double-column pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Equivalence of Probabilistic Tournament and Polynomial Ranking Selection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Equivalence of Probabilistic Tournament and Polynomial Ranking Selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equivalence of Probabilistic Tournament and Polynomial Ranking Selection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-577436