作者: He Jun , Yao Xin
DOI: 10.1007/BF02899472
关键词:
摘要: This paper introduces drift analysis approach in studying the convergence and hitting times of evolutionary algorithms. First methodology is introduced, which links algorithms with Markov chains or supermartingales. Then conditions guarantee are described. And next used to estimate presented. Finally an example given show how analyse EAs by approach.