The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including cond
A study of drift analysis for estimating computation time of evolutionary algorithms
โ Scribed by Jun He; Xin Yao
- Book ID
- 111601422
- Publisher
- Springer Netherlands
- Year
- 2004
- Tongue
- English
- Weight
- 103 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1567-7818
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In spite of many applications of evolutionary algorithms in optimisation, theoretical results on the computation time and time complexity of evolutionary algorithms on different optimisation problems are relatively few. It is still unclear when an evolutionary algorithm is expected to solve an optim
The proof of Theorem 6 in the paper by J. He and X. Yao [Artificial Intelligence 127 (1) (2001) 57-85] contains a mistake, although the theorem is correct [S. Droste et al., Theoret. Comput. Sci. 276 (2002) 51-81]. This note gives a revised proof and theorem. It turns out that the revised theorem is