Computational complexity and evolutionary computation

Evolutionary algorithms and other nature-inspired search heuristics like ant colony optimization have been shown to be very successful when dealing with real-world applications or problems from combinatorial optimization. In recent years, analyses have shown that these general randomized search heuristics can be analyzed like "ordinary" randomized algorithms and that such analyses of the expected optimization time yield deeper insights in the functioning of evolutionary algorithms in the context of approximation and optimization. This is an important research area where a lot of interesting questions are still open. The tutorial enables attendees to analyze the computational complexity of evolutionary algorithms and other search heuristics in a rigorous way. An overview of the tools and methods developed within the last 15 years is given and practical examples of the application of these analytical methods are presented.

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

[2]  Dirk Sudholt.  Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency , 2006, ISAAC.

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

[4]  Dirk Sudholt,et al.  On the runtime analysis of the 1-ANT ACO algorithm , 2007, GECCO '07.

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

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

[7]  Ingo Wegener,et al.  The analysis of evolutionary algorithms on sorting and shortest paths problems , 2004, J. Math. Model. Algorithms.

[8]  Ingo Wegener,et al.  The Ising Model on the Ring: Mutation Versus Recombination , 2004, GECCO.

[9]  Thomas Jansen,et al.  Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA , 2003, GECCO.

[10]  Thomas Jansen,et al.  Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem , 2007, GECCO '07.

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

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

[13]  Frank Neumann.  Expected runtimes of evolutionary algorithms for the Eulerian cycle problem , 2004, IEEE Congress on Evolutionary Computation.

[14]  Stefan Droste,et al.  Not all linear functions are equally difficult for the compact genetic algorithm , 2005, GECCO '05.

[15]  Dirk Sudholt,et al.  Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.