| The Analysis of a Recombinative Hill-Climber on (2007) | |||||||||||||||||
Abstract | |||||||||||||||||
| Abstract--- Many experiments have proved that crossover is an essential search operator in evolutionary algorithms, at least for certain functions. However, the rigorous analysis of such algorithms on crossover-friendly functions is still in its infancy. Here a recombinative hill-climber is analyzed on the crossover-friendly function H-IFF introduced by [10]. The dynamics of this algorithm are investigated and it is proved that the expected optimization time equals #(n log n). Keywords--- Evolutionary algorithms, recombinative hillclimbers, expected optimization time, one-point crossover. I. | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||