Abstract

. The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and finite time behavior of evolutionary algorithms with finite search spaces and discrete time scale. Results on evolutionary algorithms beyond finite space and discrete time are also presented but with reduced elaboration. Keywords: evolutionary algorithms, limit behavior, finite time behavior 1. Introduction The field of evolutionary computation is mainly engaged in the development of optimization algorithms which design is inspired by principles of natural evolution. In most cases, the optimization task is of the following type: Find an element x 2 X such that f(x ) f(x) for all x 2 X , where f : X ! IR is the objective function to be maximized and X the search set. In the terminology of evolutionary computation, an individual is represented by an element of the Cartesian product X \Theta A, where A is a possibly...

Citations

8879	Computers and Intractability: A guide to the Theory of NP-Completeness - Garey, Johnson - 1979
1566	Randomized Algorithms - MOTWANI, RAGHAVAN - 1995
574	Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution (Frommann-Holzboog - Rechenberg - 1973
300	Schlierkamp-Voosen D: Predictive models for the breeder genetic algorithm i. continuous parameter optimization. Evol Comput - Mühlenbein
295	An overview of evolutionary algorithms for parameter optimization. Evol. Comput - Bäck, Schwefel - 1993
269	Adaptive algorithms and stochastic approximations - Benveniste, M¶etivier, et al. - 1990
222	Non-Negative Matrices and Markov Chains - Seneta - 1981
170	M: Modeling genetic algorithms with markov chains - Nix, Vose - 1992
169	How easy is local search - Johnson, Papadimitriou, et al. - 1988
126	Convergence Properties of Evolutionary Algorithms - Rudolph - 1997
123	How genetic algorithms really work: I. mutation and hillclimbing. Parallel problem solving from nature 2 - Mühlenbein - 1992
95	Analysis of recursive stochastic algorithms - Ljung - 1977
92	The science of breeding and its application to the breeder genetic algorithm (BGA - Mühlenbein, Schlierkamp-Voosen - 1994
86	Minimization by random search techniques - Solis, Wets - 1981
78	The interaction of mutation rate, selection, and self-adaption within a genetic algorithm,” in Parallel Problem Solving from Nature, 2 - Bäck - 1992
75	An analysis of genetic algorithms using statistical mechanics - Prügel-Bennett, Shapiro - 1994
72	Toward a Theory of Evolution Strategies: On the Benefits of Sex - the (µ/µ,λ) Theory - Beyer - 1995
71	Punctuated equilibria in genetic search - Vose, Liepins - 1991
68	Finite Markov Processes and Their Applications - Iosifescu - 1980
66	Evolutionsstrategie und numerische optimierung - Schwefel - 1975
64	Parallel recombinative simulated annealing: A genetic Algorithm - Mahfoud, Goldberg - 1995
62	Toward a theory of evolution strategies: Self{adaptation - Beyer - 1995
61	Evolutionsstrategie ’94. Frommann-Holzboog - Rechenberg - 1994
51	M: Statistical dynamics of the Royal Road genetic algorithm. Theor Comput Sci - Nimwegen, JP, et al. - 1999
50	Toward a Theory of Evolution Strategies: Some Asymptotical Results from the (1,+ λ)-Theory - Beyer - 1993
49	Long path problems - Horn, Goldberg, et al. - 1994
48	On A Multi-objective Evolutionary Algorithm and Its Convergence To The Pareto Set - Rudolph - 1998
43	Global convergence of genetic algorithms: A Markov chain analysis - Eiben, Aarts, et al. - 1991
43	A Markov chain framework for the simple genetic algorithm - Davis, Principa - 1993
43	How mutation and selection solve long-path problems in polynomial expected time - Rudolph - 1996
41	Evolutionary programming and evolution strategies: Similarities and differences - Back, Rudolph, et al. - 1993
37	Using Markov chains to analyze GAFOs - Jong, Spears, et al. - 1995
32	A markov chain analysis on simple genetic algorithms - Suzuki - 1995
30	Convergence of non{elitist strategies - Rudolph - 1994
27	A.H.: Simple Genetic Algorithms with Linear Fitness - VOSE - 1994
27	Theory of Global Random Search - Zhigljavsky - 1991
27	Toward a theory of evolution strategies: The ( � ){theory - Beyer - 1994
26	Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets - Rudolph - 1998
24	An analysis of a simple genetic algorithm - Rabinovich, Wigderson - 1991
24	Convergence of evolutionary algorithms in general search spaces - Rudolph - 1996
23	Theoretical analysis of evolutionary algorithms with in nite population size in continuous space, part I: basic properties - Qi, Palmieri - 1994
20	Convergence properties of canonical genetic algorithms - Rudolph - 1994
18	Toward an extrapolation of the simulated annealing convergence theory onto a simple genetic algorithm - Davis - 1991
18	Convergence rates of evolutionary algorithms for a class of convex objective functions - Rudolph - 1997
16	Stochastic Convergence - Lukacs - 1975
16	Asymptotic convergence properties of genetic algorithms and evolutionary programming: Analysis and experiments - Fogel - 1994
16	Evolutionsstrategien zur numerischen Lösung von Adaptationsaufgaben - Born - 1978
16	K.: Adaptive step size random search - Schumer, Steiglitz - 1968
16	Theory of evolutionary algorithms: a bird’s eye view - Eiben, Rudolph - 1999
15	Genetic algorithm dynamics in a two-well potential - Shapiro, Prugel-Bennett - 1997