Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
|
C. Cotta, J.M. Troya Parallel Problem Solving From Nature VI, M. Schoenauer et al. (eds.), Lecture Notes in Computer Science 1917, pp. 325-334, Springer-Verlag Berlin, 2000 © Springer-Verlag Berlin Heidelberg 2000. All rights reserved. |
|
Abstract
|
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide the recombination process. Within this framework, several recombination operators are specifically designed to preserve diversity within the population, while avoiding implicit mutations. The empirical evaluation of these operators on instances of two test problems (k-EMP and permutation flowshop) shows an improvement of the results with respect to other classical operators. This improvement seems to related to the increasing degree of epistasis of the problem. | |
|
 |
|
Download BibTEX entry | |
|
 |
|
Download PDF version (245K) | |
[Back to publications page].