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

Ackley, 1987 Bäck, 1993, Optimal mutation rates in genetic search, 2 Droste, 1998, A rigorous complexity analysis of the (1+1) Evolutionary Algorithm for linear functions with Boolean inputs, 499 Feller, 1971, vol. II Fogel, 1995 Garnier, 1999, Rigorous hitting times for binary mutations, Evolutionary Comput., 7, 167, 10.1162/evco.1999.7.2.173 Goldberg, 1989 Holland, 1975 Horn, 1994, Long path problems, vol. 866, 149 Juels, 1995, Hillclimbing as a baseline Method for the evaluation of stochastic optimization Algorithms, 430 Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 Koza, 1992 R. Menke, personal communication, 1998. Motwani, 1995 Mühlenbein, 1992, How Genetic Algorithms really work. Mutation and hill-climbing, 15 Rechenberg, 1994 G. Rudolph, Convergence properties of evolutionary algorithms, Ph.D. Thesis, Verlag Dr. Kovač, Hamburg, 1997. Rudolph, 1997, How mutation and selection solve long-path problems in polynomial expected time, Evolutionary Comput., 4, 195, 10.1162/evco.1996.4.2.195 Schwefel, 1995