Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism

In this article a tool for the analysis of population-based EAs is used to derive asymptotic upper bounds on the optimization time of the algorithm solving Royal Roads problem, a test function with plateaus of fitness. In addition to this, limiting distribution of a certain subset of the population is approximated.

[1]  Pietro Simone Oliveto,et al.  Theoretical analysis of fitness-proportional selection: landscapes and efficiency , 2009, GECCO.

[2]  XI FachbereichInformatik.  Finite Markov Chain Results in Evolutionary Computation: a Tour D'horizon , 1998 .

[3]  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..

[4]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

[5]  Thomas Jansen,et al.  A building-block royal road where crossover is provably essential , 2007, GECCO '07.

[6]  Jun He.  A note on the first hitting time of (1 + λ) evolutionary algorithm for linear functions with boolean inputs , 2010, IEEE Congress on Evolutionary Computation.

[7]  Stephen R. Marsland,et al.  Convergence Properties of Two (μ+λ) Evolutionary Algorithms on OneMax and Royal Roads Test Functions , 2011, IJCCI.

[8]  Ingo Wegener,et al.  Real Royal Road Functions for Constant Population Size , 2003, GECCO.

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

[10]  Pietro Simone Oliveto,et al.  Analysis of population-based evolutionary algorithms for the vertex cover problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[11]  Xin Yao,et al.  A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

[13]  David J. Marchette,et al.  Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction , 2004, Comput. Stat. Data Anal..

[14]  Carsten Witt,et al.  Population size versus runtime of a simple evolutionary algorithm , 2008, Theor. Comput. Sci..

[15]  Xin Yao,et al.  Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..

[16]  I. Nåsell,et al.  On the quasi-stationary distribution of the stochastic logistic epidemic. , 1999, Mathematical biosciences.

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

[18]  Carsten Witt,et al.  An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions , 2004, GECCO.

[19]  Ingemar Nåsell,et al.  The quasi-stationary distribution of the closed endemic sis model , 1996, Advances in Applied Probability.

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

[21]  Kenneth A. De Jong,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms , 2004 .

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

[23]  Xin Yao,et al.  A Large Population Size Can Be Unhelpful in Evolutionary Algorithms a Large Population Size Can Be Unhelpful in Evolutionary Algorithms , 2022 .

[24]  Aram Ter-Sarkisov,et al.  Elitism Levels Traverse Mechanism for the derivation of upper bounds on unimodal functions , 2012, 2012 IEEE Congress on Evolutionary Computation.

[25]  Hao Wang,et al.  Introduction to Genetic Algorithms in Electromagnetics , 1995 .

[26]  Marc Schoenauer,et al.  Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.

[27]  Xin Yao,et al.  Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..

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