Theory of randomised search heuristics in combinatorial optimisation

Most famous search heuristic: Evolutionary Algorithms (EAs) a bio-inspired heuristic paradigm: evolution in nature, " survival of the fittest " Most famous search heuristic: Evolutionary Algorithms (EAs) a bio-inspired heuristic paradigm: evolution in nature, " survival of the fittest " actually it's only an algorithm, a randomised search heuristic (RSH) Most famous search heuristic: Evolutionary Algorithms (EAs) a bio-inspired heuristic paradigm: evolution in nature, " survival of the fittest " actually it's only an algorithm, a randomised search heuristic (RSH) Goal: optimisation Here: discrete search spaces, combinatorial optimisation, in particular pseudo-boolean functions

[1]  Xin Yao,et al.  Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85] , 2002, Artif. Intell..

[2]  Mark Jerrum,et al.  Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

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

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

[5]  Thomas Jansen,et al.  The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.

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

[7]  JansenThomas,et al.  On the analysis of the (1+ 1) evolutionary algorithm , 2002 .

[8]  Andrei Z. Broder,et al.  Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

[10]  C. Greg Plaxton,et al.  On the spanning trees of weighted graphs , 1988, Comb..

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

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

[13]  Benjamin Doerr,et al.  Refined runtime analysis of a basic ant colony optimization algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[14]  Ingo Wegener,et al.  Simulated Annealing Beats Metropolis in Combinatorial Optimization , 2005, ICALP.

[15]  Frank Neumann,et al.  Ant Colony Optimization and the minimum spanning tree problem , 2010, Theor. Comput. Sci..

[16]  Mark Jerrum,et al.  The Metropolis Algorithm for Graph Bisection , 1998, Discret. Appl. Math..

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

[18]  Jittat Fakcharoenphol,et al.  A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs , 2008, Inf. Process. Lett..

[19]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .

[20]  Gregory B. Sorkin,et al.  Efficient simulated annealing on fractal energy landscapes , 1991, Algorithmica.

[21]  Martin Skutella,et al.  Evolutionary Algorithms and Matroid Optimization Problems , 2007, GECCO '07.

[22]  HajekBruce,et al.  The time complexity of maximum matching by simulated annealing , 1988 .

[23]  Ingo Wegener,et al.  Real royal road functions for constant population size , 2003, Theor. Comput. Sci..

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

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

[26]  Frank Neumann,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .

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

[28]  Thomas Jansen,et al.  On the analysis of a dynamic evolutionary algorithm , 2006, J. Discrete Algorithms.

[29]  Thomas Jansen.  On the utility of populations , 2004 .

[30]  Frank Neumann,et al.  Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators , 2007, Evolutionary Computation.

[31]  Thomas Jansen,et al.  Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization , 2004, PPSN.

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

[33]  Bryant A. Julstrom,et al.  Biased mutation operators for subgraph-selection problems , 2006, IEEE Transactions on Evolutionary Computation.

[34]  Thomas Jansen,et al.  On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms , 2002, PPSN.

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