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
|Collections||ANU Research Publications|
|Source:||Proceedings of the 2008 Congress on Evolutionary Computation (CEC-08)|
|01_Hingee_Equivalence_of_probabilistic_2008.pdf||251.92 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.