A study of drift analysis for estimating computation time of evolutionary algorithms |
| |
| Authors: | He Jun Yao Xin |
| |
| Affiliation: | (1) The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, the University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK) |
| |
| Abstract: | This paper introduces drift analysis and its applications in estimating average computation time of evolutionary algorithms. Firstly, drift conditions for estimating upper and lower bounds of the mean first hitting times of evolutionary algorithms are presented. Then drift analysis is applied to two specific evolutionary algorithms and problems. Finally, a general classification of easy and hard problems for evolutionary algorithmsis given based on the analysis. |
| |
| Keywords: | algorithm analysis combinatorial optimisation evolutionary computation meta-heuristics |
| 本文献已被 SpringerLink 等数据库收录！ |
|
