Novel approach to polygamous selection in genetic Algorithms

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Genetic algorithms are adaptive heuristic search algorithms which have been successfully used in a number of applications and their performance are mainly influenced by selection operator. In this paper three variants of polygamous selection, a special case of elitism where the best individual of the population act as one parent for mating with other chromosomes in all crossover operations, are proposed, their performances are compared along with other selection approaches such as roulette wheel, rank, annealed etc. © 2012 Springer-Verlag GmbH Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kumar, R., & Jyotishree. (2012). Novel approach to polygamous selection in genetic Algorithms. In Advances in Intelligent and Soft Computing (Vol. 132 AISC, pp. 39–46). Springer Verlag. https://doi.org/10.1007/978-3-642-27443-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free