Crossover can provably be useful in evolutionary computation

We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoretical analysis proving the usefulness of crossover for a non-artificial problem.

[1]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

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

[3]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

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

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

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

[7]  John H. Holland,et al.  When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.

[8]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9]  Yuval Rabani,et al.  A computational view of population genetics , 1995, STOC '95.

[10]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[11]  Xin Yao,et al.  Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..

[12]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[13]  Malcolm I. Heywood,et al.  Intelligent Packets For Dynamic Network Routing Using Distributed Genetic Algorithm , 2002, GECCO.

[14]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[15]  Charles E. Taylor.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Avi Wigderson,et al.  An Analysis of a Simple Genetic Algorithm , 1991, ICGA.

[18]  Malcolm I. Heywood,et al.  Adding more intelligence to the network routing problem: AntNet and Ga-agents , 2006, Appl. Soft Comput..

[19]  S Forrest,et al.  Genetic algorithms , 1996, CSUR.

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

[21]  Avi Wigderson,et al.  Techniques for bounding the convergence rate of genetic algorithms , 1999 .

[22]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

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

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

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

[26]  Miki Haseyama,et al.  A genetic algorithm for determining multiple routes and its applications , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

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

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

[29]  Benjamin Doerr,et al.  A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem , 2007 .

[30]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[31]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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