Abstract
Evolutionary algorithms working on continuous search space can be regarded as general homogeneous Markov chains. The finite space problem of describing the transition matrix turns into the more complicated problem of defining and estimating a transition function. We analyze in this respect the (1+1) evolutionary algorithm on the inclined plane and corridor models. In the first case, the probability of maximal success in n iterations is derived in closed form, under uniform mutation. For the second case, the algorithm is proved to escape the corner of the corridor for both uniform and normal mutation, exponentially fast.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agapie, A.: Theoretical analysis of mutation-adaptive evolutionary algorithms. Evol. Comput. 9, 127–146 (2001)
Beyer, H.-G.: The Theory of Evolution Strategies. Springer, Berlin Heidelberg New York (2001)
Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1–2), 51–81 (2002)
Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutation. Evol. Comput. 7(2), 167–203 (1999)
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6, 721–741 (1984)
Haario, H., Saksman, E.: Simulated annealing process in general state space. Adv. Appl. Probab. 23, 866–893 (1991)
Häggström, O.: Finite Markov Chains and Algorithmic Applications. Cambridge University Press, UK (2002)
Nummelin, E.: General Irreducible Markov Chains and Non-negative Operators. Cambridge University Press, UK (1984)
Rapple, G.: On linear convergence of a class of random search algorithms. Z. Angew. Math. Mech. 69, 37–45 (1989)
Rudolph, G.: Convergence of evolutionary algorithms in general search spaces. In: Proceedings of the 3rd IEEE Conference on Evolutionary Computation. IEEE Press, Piscataway, New Jersey (1996)
Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Kovać, Hamburg, Germany (1997)
Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)
Wasan, M.T.: Stochastic Approximation. Cambridge University Press, UK (1969)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Agapie, A., Agapie, M. Transition Functions for Evolutionary Algorithms on Continuous State-space. J Math Model Algor 6, 297–315 (2007). https://doi.org/10.1007/s10852-006-9045-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-006-9045-2