Abstract
In genetic algorithms, tournament schemes are often applied as selection operators. The advantage is simplicity and efficiency. On the other hand, major deficiencies related to tournament selection are the coarse scaling of the selection pressure and the poor sampling accuracy. We introduce a new variant of tournament selection which provides an adjustable probability distribution, a fine-tuning facility for the selection pressure and an improved sampling accuracy at the cost of a minimal increase of the complexity and with almost no loss of efficiency.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Huber, R., Schell, T. Mixed size tournament selection. Soft Computing 6, 449–455 (2002). https://doi.org/10.1007/s00500-001-0160-8
Issue Date:
DOI: https://doi.org/10.1007/s00500-001-0160-8