Multi-parent Recombination to Overcome Premature Convergence in Genetic Algorithms

Multi-parent Recombination to Overcome Premature Convergence in Genetic Algorithms

Auteur : C. H. M. van Kemenade, A. E. Eiben

Date de publication : 1995

Éditeur : Department of Algorithmics and Architecture, CWI

Nombre de pages : 8

Résumé du livre

Abstract: "Recent research shows that enlarging the arity of recombination operators in a Genetic Algorithm lowers the probability of premature convergence. This results in more robust genetic function optimizers. In this paper we try to give an explanation why these multi- parent operators are better. In particular, we discuss two operators: the uniform scanning crossover and the diagonal crossover operator. First we show that these operators are better than the standard ones by testing them on an extensive test-suite of function optimization problems. Second, we explain the empirical results by first looking at the influence that the operators have on the evolution of populations and then by using a new kind of description we are able to explain the convergence curves and rates of success as obtained in the experiments."

Connexion / Inscription

Saisissez votre e-mail pour vous connecter ou créer un compte

Connexion

Inscription

Mot de passe oublié ?

Nous allons vous envoyer un message pour vous permettre de vous connecter.