A Blend of Markov-Chain and Drift Analysis

  • Jens Jägersküpper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)

Abstract

In their seminal article [Theo. Comp. Sci. 276(2002):51–82] Droste, Jansen, and Wegener present the first theoretical analysis of the expected runtime of a basic direct-search heuristic with a global search operator, namely the (1+1) Evolutionary Algorithm (EA), for the class of linear functions over the search space {0,1}n. In a rather long and involved proof they show that, for any linear function, the expected runtime of the EA is O(nlogn), i.e., that there are two constants c and n′ such that, for n ≥ n′, the expected number of iterations until a global optimum is generated is bound above by c·nlogn. However, neither c nor n′ are specified – they would be pretty large. Here we reconsider this optimization scenario to demonstrate the potential of an analytical method that makes use not only of the drift (w.r.t. a potential function, here the number of bits set correctly), but also of the distribution of the evolving candidate solution over the search space {0,1}n: An invariance property of this distribution is proved, which is then used to derive a significantly better lower bound on the drift. Finally, this better estimate of the drift results in an upper bound on the expected number of iterations of 3.8 nlog2n + 7.6log2n for n ≥ 2.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rudolph, G.: Finite Markov chain results in evolutionary computation: A tour d’horizon. Fundamenta Informaticae 35, 67–89 (1998)MATHMathSciNetGoogle Scholar
  2. 2.
    Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276, 51–82 (2002)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127, 57–85 (2001)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    He, J., Yao, X.: Erratum to: Drift analysis and average time complexity of evolutionary algorithms [3]. Artificial Intelligence 140, 245–248 (2002)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Jägersküpper, J.: A mix of Markov-chain and drift analysis. Technical Report CI-250/08, TU Dortmund, SFB 531 (2008)Google Scholar
  6. 6.
    Jägersküpper, J.: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science 379, 329–347 (2007)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Jägersküpper, J., Witt, C.: Rigorous runtime analysis of a (μ+1) ES for the Sphere function. In: Proc. 2005 Genetic and Evolutionary Computation Conference (GECCO), pp. 849–856. ACM Press, New York (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jens Jägersküpper
    • 1
  1. 1.Technische Universität DortmundDortmundGermany

Personalised recommendations