Potholes on the Royal Road

It is still unclear how an evolutionary algorithm (EA) searches a fitness landscape, and on what fitness landscapes a particular EA will do well. The validity of the building-block hypothesis, a major tenet of traditional genetic algorithm theory, remains controversial despite its continued use to justify claims about EAs. This paper outlines a research program to begin to answer some of these open questions, by extending the work done in the royal road project. The short-term goal is to find a simple class of functions which the simple genetic algorithm optimizes better than other optimization methods, such as hill-climbers. A dialectical heuristic for searching for such a class is introduced. As an example of using the heuristic, the simple genetic algorithm is compared with a set of hillclimbers on a simple subset of the hyperplane-defined functions, the pothole functions.

[1]  Victor J. Rayward-Smith,et al.  The Royal Road Functions: Description, Intent and Experimentation , 1996, Evolutionary Computing, AISB Workshop.

[2]  Terry Jones,et al.  Crossover, Macromutationand, and Population-Based Search , 1995, ICGA.

[3]  R. Punnett,et al.  The Genetical Theory of Natural Selection , 1930, Nature.

[4]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[5]  Terry Jones,et al.  A Description of Holland's Royal Road Function , 1994, Evolutionary Computation.

[6]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[7]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[8]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[9]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

[10]  Lee Altenberg,et al.  The Schema Theorem and Price's Theorem , 1994, FOGA.

[11]  Paul Thagard,et al.  Induction: Processes Of Inference , 1989 .

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

[13]  Una-May O'Reilly,et al.  The Troubling Aspects of a Building Block Hypothesis for Genetic Programming , 1994, FOGA.

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

[15]  A. Newell.  Unified Theories of Cognition , 1990 .

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

[17]  Michael D. Vose,et al.  A Critical Examination of the Schema Theorem , 1993 .

[18]  John H. Holland,et al.  Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions , 2000, Evolutionary Computation.

[19]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[20]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

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

[22]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[23]  Kennetb A. De.  Genetic Algorithms Are NOT Function Optimizers , 1992 .

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

[25]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

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

[27]  G. Dueck.  New optimization heuristics , 1993 .

[28]  John H. Holland,et al.  Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.

[29]  A. J. Noordwijk.  Futuyma, D. J. 1986. Evolutionary Biology 2nd edition, Sinauer Associates Inc. Sunderland, Mass. , 1988 .

[30]  John J. Grefenstette,et al.  Deception Considered Harmful , 1992, FOGA.