中文摘要：

计算时间分析是进化算法理论基础研究中的重要课题,也是一大难点.该文基于停时理论,结合时齐马氏过程的性质,将进化算法的首达时间视为停时,提出了分析进化算法首达时间的一个新方法.在此框架下,Level-reaching Estimation Technique作为特例得到了严格的证明.为展示如何用该理论方法分析具体问题,以（1＋λ）EA求解PEAK函数和（1＋λ）ES求解倾斜平面问题为实例,分析了平均首达时间.结果表明,该文所提出的方法不但适用于离散优化问题也适用于连续优化问题,具有通用性.

英文摘要：

In contrast to fruitful research results of evolutionary algorithms in practical applications,the theoretical results are still relatively few.Computational time analysis is an important and hard topic in the research of theoretical foundation of evolutionary algorithms.Based on stopping time theory,combining the properties of homogeneous Markov chain,this article regards the first hitting time of evolutionary algorithms as a stopping time and proposes a new general analytic framework.Under this framework,the Level-reaching Estimation Technique is proven rigorously as a special case.To illustrate how the proposed method can be applied to concrete problems in analyzing the expected first hitting time of EAs,we analyze the runtime of（1＋λ）EA on PEAK function and（1＋λ）ES on inclined plane problem.The results show that the proposed method has generality,it is not only suitable for discrete optimization but also suitable for continuous optimization.