On the analysis of a dynamic evolutionary algorithm

Bäck, 1993, Optimal mutation rates in genetic search, 2 Bäck, 1998, An overview of parameter control methods by self-adaptation in evolutionary algorithms, Fundamenta Informaticae, 35, 51, 10.3233/FI-1998-35123404 Beyer, 1993, Toward a theory of evolution strategies: Some asymptotical results from the (1+λ)-theory, Evol. Comput., 1, 165, 10.1162/evco.1993.1.2.165 Droste, 1998, On the optimization of unimodal functions with the (1+1) evolutionary algorithm, vol. 1498, 13 Droste, 2000, Dynamic parameter control in simple evolutionary algorithms, 275 Droste, 2002, On the analysis of the (1+1) evolutionary algorithm, Theoret. Comput. Sci., 276, 51, 10.1016/S0304-3975(01)00182-7 Droste, 2003, Theory of evolutionary algorithms and genetic programming, 107 Feller, 1971 Garnier, 1999, Rigorous hitting times for binary mutations, Evol. Comput., 7, 173, 10.1162/evco.1999.7.2.173 Horn, 1994, Long path problems, vol. 866, 149 Jansen, 2000, On the choice of the mutation probability for the (1+1) EA, vol. 1917, 89 Mühlenbein, 1992, How genetic algorithms really work. Mutation and hillclimbing, 15 Rudolph, 1997 Rudolph, 1997, How mutation and selection solve long path-problems in polynomial expected time, Evol. Comput., 4, 195, 10.1162/evco.1996.4.2.195 I. Wegener, C. Witt, On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions, J. Discrete Algorithms (2005), in press