Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results

Computational time complexity analyzes of evolutionary algorithms (EAs) have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the (1+1)-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the (1+1)-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solred problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.

[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]  Jessica Andrea Carballido,et al.  On Stopping Criteria for Genetic Algorithms , 2004, SBIA.

[3]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[4]  Ingo Wegener,et al.  A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.

[5]  Günter Rudolph,et al.  Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.

[6]  Frank Neumann,et al.  Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem , 2004, GECCO.

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

[8]  Thomas Jansen,et al.  On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm , 1998, PPSN.

[9]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[10]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[11]  Ingo Wegener,et al.  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..

[12]  Carsten Witt,et al.  Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.

[13]  Richard W. Madsen,et al.  Markov Chains: Theory and Applications , 1976 .

[14]  I. Wegener.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Design and Analysis of Evolutionary Algorithms , 2004 .

[15]  Frank Neumann,et al.  Expected runtimes of evolutionary algorithms for the Eulerian cycle problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[16]  Ingo Wegener,et al.  On the utility of populations in evolutionary algorithms , 2001 .

[17]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[18]  Stephen Marshall,et al.  Convergence Criteria for Genetic Algorithms , 2000, SIAM J. Comput..

[19]  Ingo Wegener,et al.  Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.

[20]  Carsten Witt,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .

[21]  P. Bahr,et al.  Sampling: Theory and Applications , 2020, Applied and Numerical Harmonic Analysis.

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

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

[24]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[25]  Pietro Simone Oliveto,et al.  Evolutionary algorithms and the Vertex Cover problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[26]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[27]  Benjamin Doerr,et al.  Faster Evolutionary Algorithms by Superior Graph Representation , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

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

[29]  Tobias Storch,et al.  Finding large cliques in sparse semi-random graphs by simple randomized search heuristics , 2007, Theor. Comput. Sci..

[30]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

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

[33]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[34]  増山 繁,et al.  グラフの構造的特徴と効率の良い並列アルゴリズムについて (Algorithm Engineering as a New Paradigm) , 2001 .

[35]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[36]  Ingo Wegener,et al.  Theoretical Aspects of Evolutionary Algorithms , 2001, ICALP.

[37]  D. Cooke,et al.  Finite Markov Processes and Their Applications , 1981 .

[38]  Dean Isaacson,et al.  Markov Chains: Theory and Applications , 1976 .

[39]  Pietro Simone Oliveto,et al.  On the Convergence of Immune Algorithms , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[40]  Thomas Jansen,et al.  On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help , 1999 .

[41]  Ingo Wegener,et al.  Fitness Landscapes Based on Sorting and Shortest Paths Problems , 2002, PPSN.

[42]  Haldun Aytug,et al.  Stopping Criteria for Finite Length Genetic Algorithms , 1996, INFORMS J. Comput..

[43]  Benjamin Doerr,et al.  Adjacency list matchings: an ideal genotype for cycle covers , 2007, GECCO '07.

[44]  Tobias Storch,et al.  How randomized search heuristics find maximum cliques in planar graphs , 2006, GECCO.

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

[46]  Günter Rudolph,et al.  Theory of Evolutionary Algorithms: A Bird's Eye View , 1999, Theor. Comput. Sci..

[47]  Ingo Wegener,et al.  Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..

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

[49]  RudolphGünter.  Finite Markov chain results in evolutionary computation , 1998 .

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

[51]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[52]  Bruce E. Hajek,et al.  The time complexity of maximum matching by simulated annealing , 1988, JACM.

[53]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[54]  C. Witt.  Population size vs. runtime of a simple EA , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[55]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[56]  Thomas Bäck,et al.  Optimal Mutation Rates in Genetic Search , 1993, ICGA.

[57]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[58]  C. Witt.  Population Size vs . Runtime of a Simple Evolutionary Algorithm , 2003 .

[59]  Hans-Paul Schwefel,et al.  How to analyse evolutionary algorithms , 2002, Theor. Comput. Sci..

[60]  Frank Neumann,et al.  Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators , 2006, PPSN.

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

[62]  Yew-Soon Ong,et al.  Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I , 2005, ICNC.

[63]  Jens Jägersküpper,et al.  When the Plus Strategy Outperforms the Comma Strategyand When Not , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[64]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

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