DocumentCode
804944
Title
The analysis of a recombinative hill-climber on H-IFF
Author
Dietzfelbinger, Martin ; Naudts, Bart ; Van Hoyweghen, Clarissa ; Wegener, Ingo
Author_Institution
Fakultat fur Informatik und Automatisierung, TU Ilmenau, Germany
Volume
7
Issue
5
fYear
2003
Firstpage
417
Lastpage
423
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 hierarchical-if-and-only-if (H-IFF) introduced by Watson et al. (1998). The dynamics of this algorithm are investigated and it is proved that the expected optimization time equals Θ(n log n).
Keywords
computational complexity; evolutionary computation; search problems; H-IFF; crossover-friendly function; evolutionary algorithms; hierarchical-if-and-only-if; lower bound; one-point crossover; optimization time; recombinative hill-climber; search operator; Algorithm design and analysis; Computer science; Evolutionary computation; Genetic algorithms; Genetic mutations; Helium; Heuristic algorithms; Mathematics; Random variables; Stochastic processes;
fLanguage
English
Journal_Title
Evolutionary Computation, IEEE Transactions on
Publisher
ieee
ISSN
1089-778X
Type
jour
DOI
10.1109/TEVC.2003.818192
Filename
1237161
Link To Document