The analysis of a recombinative hill-climber on H-IFF

被引：26

作者：

Dietzfelbinger, M ^{[1
]}

Naudts, B

Van Hoyweghen, C

Wegener, I

机构：

[1] Tech Univ Ilmenau, Fak Informat & Automatisierung, D-98694 Ilmenau, Germany

[2] Univ Antwerp, RUCA, Dept Math & Comp Sci, B-2020 Antwerp, Belgium

[3] Univ Dortmund, FB Informat, D-44221 Dortmund, Germany

来源：

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION | 2003年 / 7卷 / 05期

关键词：

evolutionary algorithms; expected optimization time; one-point crossover; recombinative hill-climbers;

D O I：

10.1109/TEVC.2003.818192

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 Theta (n log n).

引用

页码：417 / 423

页数：7

共 10 条

[1] [Anonymous], RANDOMIZED ALGORITHM
[2] CULBERSON J, 1992, TR9202 U ALB
[3] HOHN C, 1996, LNCS, V1141, P134
[4] JANSEN T, 2001, P GEN EV COMP C 2001, P735
[5] Naudts B, 1998, LECT NOTES COMPUT SC, V1498, P67, DOI 10.1007/BFb0056850
[6] HOW TO EMULATE SHARED MEMORY
RANADE, AG
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1991, 42 (03) : 307 - 326
[7] VANHOYWEGHEN C, 2001, P GEN EV COMP C GECC, P694
[8] VANHOYWEGHEN C, 2001, UNPUB J EVOL COMPUT
[9] Watson RA, 1998, LECT NOTES COMPUT SC, V1498, P97, DOI 10.1007/BFb0056853
[10] Watson RA., 2001, FDN GENETIC ALGORITH, P69

← 1 →