Backward-chaining evolutionary algorithms

Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)-tournament selection-we highlight a previously-unknown source of inefficiency. This leads us to rethink the order in which operations are performed within EAs, and to suggest an algorithm-the EA with efficient macro-selection-that avoids the inefficiencies associated with tournament selection. This algorithm has the same expected behaviour as the standard EA but yields considerable savings in terms of fitness evaluations. Since fitness evaluation typically dominates the resources needed to solve any non-trivial problem, these savings translate into a reduction in computer time. Noting the connection between the algorithm and rule-based systems, we then further modify the order of operations in the EA, effectively turning the evolutionary search into an inference process operating in backward-chaining mode. The resulting backward-chaining EA creates and evaluates individuals recursively, backward from the last generation to the first, using depth-first search and backtracking. It is even more powerful than the EA with efficient macro-selection in that it shares all its benefits, but it also provably finds fitter solutions sooner, i.e., it is a faster algorithm. These algorithms can be applied to any form of population based search, any representation, fitness function, crossover and mutation, provided they use tournament selection. We analyse their behaviour and benefits both theoretically, using Markov chain theory and space/time complexity analysis, and empirically, by performing a variety of experiments with standard and back-ward chaining versions of genetic algorithms and genetic programming.

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

[2]  Kiyosi Itô,et al.  On stochastic processes (I) , 1941 .

[3]  John R. Koza,et al.  Genetic Programming IV: Routine Human-Competitive Machine Intelligence , 2003 .

[4]  C. Stephens Some exact results from a coarse grained formulation of genetic dynamics , 2001, nlin/0105029.

[5]  J. Doob Stochastic processes , 1953 .

[6]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[7]  Riccardo Poli,et al.  Exact Schema Theory and Markov Chain Models for Genetic Programming and Variable-length Genetic Algorithms with Homologous Crossover , 2004, Genetic Programming and Evolvable Machines.

[8]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[9]  D. Goldberg,et al.  Modeling tournament selection with replacement using apparent added noise , 2001 .

[10]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[11]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

[12]  Riccardo Poli,et al.  A schema theory analysis of mutation size biases in genetic programming with linear representations , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[13]  Michael D. Vose,et al.  Modeling genetic algorithms with Markov chains , 1992, Annals of Mathematics and Artificial Intelligence.

[14]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

[15]  Riccardo Poli,et al.  Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover , 2001, Genetic Programming and Evolvable Machines.

[16]  G. Cowles Studies of Mascarene Island birds: The fossil record , 1987 .

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

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

[19]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

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

[21]  R. Poli,et al.  Markov chain models for GP and variable-length GAs with homologous crossover , 2001 .

[22]  Riccardo Poli,et al.  Backward-chaining genetic programming , 2005, GECCO '05.

[23]  José Carlos Príncipe,et al.  A Markov Chain Framework for the Simple Genetic Algorithm , 1993, Evolutionary Computation.

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

[25]  Christopher R. Stephens,et al.  Schemata Evolution and Building Blocks , 1999, Evolutionary Computation.

[26]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 : Advanced Algorithms and Operators , 2000 .

[27]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[28]  Astro Teller,et al.  Automatically Choosing the Number of Fitness Cases: The Rational Allocation of Trials , 1997 .

[29]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

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

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

[32]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover , 2001, EuroGP.

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

[34]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[35]  David B. Fogel,et al.  Evolution-ary Computation 1: Basic Algorithms and Operators , 2000 .

[36]  L. Darrell Whitley,et al.  Unbiased tournament selection , 2005, GECCO '05.

[37]  Christopher R. Stephens,et al.  Effective Degrees of Freedom in Genetic Algorithms and the Block Hypothesis , 1997, ICGA.

[38]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[39]  Riccardo Poli,et al.  The evolution of size and shape , 1999 .

[40]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

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

[42]  Tatsuya Motoki,et al.  Calculating the Expected Loss of Diversity of Selection Schemes , 2002, Evolutionary Computation.

[43]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part I , 2003, Evolutionary Computation.

[44]  John R. Koza,et al.  A genetic approach to the truck backer upper problem and the inter-twined spiral problem , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.

[45]  Alden H. Wright,et al.  Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms , 2002, GECCO.

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

[47]  Kenneth A. De Jong,et al.  Using Markov Chains to Analyze GAFOs , 1994, FOGA.

[48]  Riccardo Poli,et al.  Evolutionary Computation Cookbook: Recipes for Designing New Algorithms , 1996 .

[49]  John R. Koza,et al.  Genetic programming 1997 : proceedings of the Second Annual Conference, July 13-16, 1997, Stanford University , 1997 .

[50]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[51]  Wolfgang Banzhaf,et al.  Genetic Programming: An Introduction , 1997 .

[52]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II , 2003, Evolutionary Computation.

[53]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

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

[55]  Lothar Thiele,et al.  A Mathematical Analysis of Tournament Selection , 1995, ICGA.

[56]  J. K. Kinnear,et al.  Advances in Genetic Programming , 1994 .

[57]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[58]  Lawrence J. Fogel,et al.  Intelligence Through Simulated Evolution: Forty Years of Evolutionary Programming , 1999 .

[59]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

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

[61]  Riccardo Poli,et al.  Tournament Selection, Iterated Coupon-Collection Problem, and Backward-Chaining Evolutionary Algorithms , 2005, FOGA.

[62]  David B. Fogel,et al.  Evolutionary Computation: The Fossil Record , 1998 .

[63]  Scott Robert Ladd,et al.  Genetic algorithms in C , 1995 .