About the Time Complexity of EAs Based on Finite Search Space

Some results about the computation time of evolutionary algorithms are obtained in this paper. First, some exact analytic expressions of the mean first hitting times of evolutionary algorithms infinite search spaces are acquired theoretically by using the properties of Markov chain associated with evolutionary algorithms considered here. Then, by introducing drift analysis and applying Dynkin´s formula, the general upper and lower bounds of the mean first hitting times of evolutionary algorithms are estimated