Abstract
The computational time complexity is an important topic in the theory of evolutionary algorithms. This paper introduces drift analysis into analysing the average time complexity of evolutionary algorithms, which are applicable to a wide range of evolutionary algorithms and many problems. Based on the drift analysis, some useful drift conditions to determine the time complexity of evolutionary algorithms are studied. These conditions are applied into the fully deceptive problem to verify their efficiency.
| Original language | English |
|---|---|
| Pages (from-to) | 1775-1783 |
| Number of pages | 9 |
| Journal | Ruan Jian Xue Bao/Journal of Software |
| Volume | 12 |
| Issue number | 12 |
| Publication status | Published - 2001 |
| Externally published | Yes |
Keywords
- Combinatorial optimisation
- Evolutionary algorithms
- Markov chain
- Time complexity