论文信息 - Convergence Properties of Two ({\mu} + {\lambda}) Evolutionary Algorithms On OneMax and Royal Roads Test Functions

Convergence Properties of Two ({\mu} + {\lambda}) Evolutionary Algorithms On OneMax and Royal Roads Test Functions

We present a number of bounds on convergence time for two elitist population-based Evolutionary Algorithms using a recombination operator k-Bit-Swap and a mainstream Randomized Local Search algorithm. We study the effect of distribution of elite species and population size.

Aram Ter-Sarkisov | Stephen Marsland

[1] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[2] Mahmoud Fouz,et al. Quasirandom evolutionary algorithms , 2010, GECCO '10.

[3] Benjamin Doerr,et al. Drift analysis and linear functions revisited , 2010, IEEE Congress on Evolutionary Computation.

[4] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .

[5] Benjamin Doerr,et al. Multiplicative drift analysis , 2010, GECCO.

[6] Xin Yao,et al. From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[7] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.

[8] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.

[9] Stephen R. Marsland,et al. The K-bit-swap: a new genetic algorithm operator , 2010, GECCO '10.