Abstract: Running-time analysis of the continuous evolutionary algorithm is a difficult problem now existing in the field at home and abroad. To deal with this issue, the paper gave an in-depth studies about the running time of evolutionary programming based on Levy mutation(LEP). The procedure is as follows:First,LEP algorithm was modeled on the basis of an absorbing Markov process, which proved the optimal solution of the I_EP convergence. Second, the expected first hitting time was used to evaluate the running time of LEP algorithm by taking its computational properties into consideration. Finally, based on the similar transformation of I_cvy distribution, an estimation equation of I_EP running time was proposed. The research results indicate that the upper bounds for the running time arc directly influenced by the Lebesgue measurement of the optimal space, its population scale and the searching range.

Key words: Artificial intelligence, Evolutionary computation, Evolutionary programming, Computational time, I_cvy mu- 11l.lOn