Performance and scalability of genetic algorithms on NK-landscapes

Abstract:

This work studies the working principles, performance, and scalability of genetic algorithms on NK-landscapes varying the degree of epistasis interactions. Previous works that have focused mostly on recombination have shown that simple genetic algorithms, and some improved ones, perform worse than random bit climbers and not better than random search on landscapes of increased epistasis. In our work, in addition to recombination, we also study the effects on performance of selection, mutation, and drift. We show that an appropriate selection pressure and postponing drift make genetic algorithms quite robust on NK-landscapes, outperforming random bit climber on a broad range of classes of problems. We also show that the interaction of parallel varying-mutation with crossover improves further the reliability of the genetic algorithm. © 2008 Springer-Verlag Berlin Heidelberg.

Año de publicación:

2008

Keywords:

• Recombination
• drift
• NK-landscapes
• Nonlinear fitness funtions
• Selection
• Genetic Algorithm
• mutation
• Epistasis

Fuente:

scopus