Computational Complexity of Evolutionary Computation in Combinatorial Optimisation

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

[2]  Frank Neumann.  Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem , 2004, PPSN.

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

[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]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

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

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

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

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

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

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

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

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

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

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

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

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

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

[19]  Martin Skutella,et al.  Evolutionary algorithms and matroid optimization problems , 2007, GECCO.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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