DocumentCode
3398498
Title
To understand one-dimensional continuous fitness landscapes by drift analysis
Author
He, Jun ; Yao, Xin ; Zhang, Qingfu
Author_Institution
Sch. of Comput. Sci., Birmingham Univ., UK
Volume
2
fYear
2004
fDate
19-23 June 2004
Firstpage
1248
Abstract
This work shows that we could describe the characteristics of easy and hard fitness landscapes in one-dimensional continuous space by drift analysis. The work expends the existing results in the discrete space into the continue space. A fitness landscape, here, is regarded as the behaviour of an evolutionary algorithm on fitness functions. Based on the drift analysis, easy fitness landscapes are thought to be a "short-distance" landscape, which is easy for the evolutionary algorithm to find the optimal point; and hard fitness landscapes then are as a far-distance landscape, which the evolutionary algorithm had to spend a long time to find the optimal point.
Keywords
evolutionary computation; 1D continuous fitness landscapes; 1D continuous space; algorithm analysis; discrete space; drift analysis; easy fitness landscape; evolutionary algorithm; far-distance landscape; first hitting time; fitness functions; hard fitness landscape; optimal point; short-distance landscape; Algorithm design and analysis; Computer science; Convergence; Counting circuits; Evolutionary computation; Gaussian distribution; Genetic algorithms; Helium; Random variables;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1331040
Filename
1331040
Link To Document