Abstract
The computation time of general adaptive evolutionary algorithms based on finite search space is investigated in this paper. An adaptive evolutionary algorithm can be formalized as an inhomogeneous Markov chain. By using Markov property, some exact analytic expressions of the mean first hitting time corresponding to the adaptive evolutionary algorithm are obtained. The upper and lower bounds are also estimated by introducing drift analysis and Dynkin’s formula. Furthermore, the convergence of a constructive adaptive (1 + 1) −EA is studied and its time complexity for a well-known toy problem is given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Eiben, A.E., Rudolph, G.: Theory of evolutionary algorithms: A bird’s eye view. Theoretical Computer Science 229(1-2), 3–9 (1999)
Rudolph, G.: How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation 4(2), 194–205 (1996)
Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation 7(2), 167–203 (1999)
Garnier, J., Kallel, L.: Statistical distribution of the convergence time of evolutionary algorithms for long path problems. IEEE Trans.on Evolutionary Computation 4(1), 16–30 (2000)
Droste, S., Jansen, T., Wegener, I.: A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for linear functions with Boolean inputs. Evolutionary Computation 6(2), 185–196 (1998)
Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1 + 1) evolutionary algorithms. Theoretical Computer Science 276(1-2), 51–81 (2002)
He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127(1), 57–85 (2001)
He, J., Yao, X.: From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. on Evolutionary computation 6(5), 495–511 (2002)
He, J., Yao, X.: Towards an analytic framework for analyzing the computation time of evolutionary algorithms. Artificial Intelligence 145(1-2), 59–97 (2003)
He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing 3, 21–35 (2004)
He, J., et al.: A note on problem difficulty measure in black-box optimization: Classification, existence and predictability. Evolutionary Computation 15(4), 435–443 (2007)
Oliveto, P.S., He, J., Yao, X.: Time complexity of evolutionary for combinatorial optimization: A decade of results. International J. of Automation and Computing 4(3), 281–293 (2007)
Ding, L.X., Yu, J.H.: Some analysis about the time complexity of evolutionary algorithms. Neural, Parallel & Scientific Computation 14(1), 51–68 (2006)
Ding, L.X., Yu, J.H.: Some theoretical results about the asymptotic behaviors of evolutionary algorithms. LNCS (LNAI), vol. 4456, pp. 156–166. Springer, Heidelberg (2007)
Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability, 3rd edn. Springer, New York (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, L., Yu, J. (2008). About the Computation Time of Adaptive Evolutionary Algorithms. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2008. Lecture Notes in Computer Science, vol 5370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92137-0_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-92137-0_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92136-3
Online ISBN: 978-3-540-92137-0
eBook Packages: Computer ScienceComputer Science (R0)