A rigorous proof of a fundamental theorem in the drift analysis of evolutionary algorithms
暂无分享,去创建一个
A fundamental theorem in the drift analysis of EAs was initially presented in Jun He and Xin Yao's paper(Artificial Intelligence 127(1) (2001) 57–85). However, the theorem remained defective in spite of its successful applications in some specific cases. This paper points out those defects, then suggests some modifications on the theorem and introduces a new and rigorous proof. This work is expected to contribute to the solid foundation of runtime analysis of Evolutionary Algorithms.
[1] Zhifeng Hao,et al. A Time Complexity Analysis of ACO for Linear Functions , 2006, SEAL.
[2] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[3] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[4] Xin Yao,et al. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..