Abstract
This paper 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, in this paper, 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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004 |
Pages | 1248-1253 |
Number of pages | 6 |
Volume | 2 |
Publication status | Published - 2004 |
Externally published | Yes |
Keywords
- Analysis of Algorithms
- Evolutionary Algorithms
- First Hitting Time
- Fitness Landscapes