About the Computation Time of Adaptive Evolutionary Algorithms

Authors:
Lixin Ding;Jinghu Yu
Affiliations:
School of Computer, China University of Geosciences, Wuhan, China 430074 and State Key Lab of Software Engineering, Wuhan University, Wuhan, China 430072;Department of Mathematics, School of Sciences, Wuhan University of Technology, Wuhan, China 430070
Venue:
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Year:
2008

Citing 11
Cited 0

Theory of evolutionary algorithms: a bird's eye view

Theoretical Computer Science - Special issue on evolutionary computation
Drift analysis and average time complexity of evolutionary algorithms

Artificial Intelligence
On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
Towards an analytic framework for analysing the computation time of evolutionary algorithms

Artificial Intelligence
A study of drift analysis for estimating computation time of evolutionary algorithms

Natural Computing: an international journal
A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability

Evolutionary Computation
How mutation and selection solve long-path problems in polynomial expected time

Evolutionary Computation
A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs

Evolutionary Computation
Rigorous hitting times for binary mutations

Evolutionary Computation
Statistical distribution of the convergence time of evolutionaryalgorithms for long-path problems

IEEE Transactions on Evolutionary Computation
From an individual to a population: an analysis of the firsthitting time of population-based evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.