Abstract
This paper introduces drift analysis and its applications in estimating average computation time of evolutionary algorithms. Firstly, drift conditions for estimating upper and lower bounds of the mean first hitting times of evolutionary algorithms are presented. Then drift analysis is applied to two specific evolutionary algorithms and problems. Finally, a general classification of easy and hard problems for evolutionary algorithmsis given based on the analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beyer H-G (2001) The Theory of Evolutionary Strategies. Springer, Berlin
Beyer H-G, Schwefel H-P and Wegener I (2002) How to analyse evolutionary algorithms. Theoretical Computer Science 287(1): 101–130
Chow YS and Teicher H (1988) Probability Theory: Independence, Interchangeability and Martingales, 2nd edn. Springer-Verlag, New York
Droste S, Jansen T and Wegener I (1998) A rigorous complexity analysis of the (1 + 1)-evolutionary algorithm for linear functions with Boolean inputs. Evolutionary Computation 6(2): 185–196
Droste S, Jansen T and Wegener I (2002) On the analysis of the (1 + 1)-evolutionary algorithms. Theoretical Computer Science 276(1–2): 51–81
Eiben AE and Rudolph G (1999) Theory of evolutionary algorithms: A bird's eye view. Theoretical Computer Science 229(1–2): 3–9
Hajek B (1982) Hitting time and occupation time bounds implied by drift analysis with applications. Advances in Applied Probability 14(3): 502–525
He J and Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127(1): 57–85 (Erratum in (2002) Artificial Intelligence 140(1): 245–248)
He J and Yao X (2002) From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation 6(5): 495–511
He J and Yao X (2003) Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artificial Intelligence 145(1–2): 59–97
Meyn SP and Tweedie RL (1993) Markov Chains and Stochastic Stability. Springer-Verlag, New York
Rudolph G (1994) Convergence of non-elitist strategies. In: Proc. of the First IEEE conference on Evolutionary Computation, Vol. 1, pp. 63–66. IEEE Press, Piscataway, NJ
Rudolph G (1998) Finite Markov chain results in evolutionary computation: A tour d'horizon. Fundamenta Informaticae 35(1–4): 67–89
Sasaki GH and Hajek B (1988) The time complexity of maximum matching by simulated annealing. J ACM 35(2): 387–403
Syski R (1992) Passage Times for Markov Chains. IOS Press, Amsterdam
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
He, J., Yao, X. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing 3, 21–35 (2004). https://doi.org/10.1023/B:NACO.0000023417.31393.c7
Issue Date:
DOI: https://doi.org/10.1023/B:NACO.0000023417.31393.c7