Elitism Levels Traverse Mechanism for the derivation of upper bounds on unimodal functions

In this article we present an Elitism Levels Traverse Mechanism that we designed to find bounds on population-based Evolutionary Algorithms solving unimodal functions. We prove its efficiency theoretically and test it on OneMax function deriving bounds cμn log n-O(μn). This analysis can be generalized to any similar algorithm using variants of elitist selection and genetic operators that flip or swap only 1 bit in each string.

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

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

[3]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[4]  Carsten Witt,et al.  Runtime Analysis of the ( μ +1) EA on Simple Pseudo-Boolean Functions , 2006 .

[5]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[6]  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).

[7]  Mahmoud Fouz,et al.  Sharp bounds by probability-generating functions and variable drift , 2011, GECCO '11.

[8]  Stephen R. Marsland,et al.  Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function , 2011, Australasian Conference on Artificial Intelligence.

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

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

[11]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

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

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

[14]  Benjamin Doerr,et al.  Multiplicative Drift Analysis , 2010, GECCO '10.

[15]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

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

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

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

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

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

[21]  Ingo Wegener,et al.  Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .