New directions in genetic algorithm theory

Recently, several classical Genetic Algorithm principles have been challenged - including the Fundamental Theorem of Genetic Algorithms and the Principle of Minimal Alphabets. In addition, the recent No Free Lunch theorems raise further concerns. In this paper we review these issues and offer some new directions for GA researchers.

[1]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[2]  Schloss Birlinghoven.  Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .

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

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

[5]  Nicholas J. Radcliffe,et al.  Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[6]  Gary J. Koehler,et al.  A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets , 1997 .

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

[8]  Alden H. Wright,et al.  Simple Genetic Algorithms with Linear Fitness , 1994, Evolutionary Computation.

[9]  J. D. Schaffer,et al.  Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition) , 1984 .

[10]  Siddhartha Bhattacharyya,et al.  General Cardinality Genetic Algorithms , 1997, Evolutionary Computation.

[11]  Siddhartha Bhattacharyya,et al.  An Analysis of Non-Binary Genetic Algorithms with Cardinality 2υ , 1994, Complex Syst..

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

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

[14]  Haldun Aytug,et al.  Stopping Criteria for Finite Length Genetic Algorithms , 1996, INFORMS J. Comput..

[15]  Michael D. Vose,et al.  Formalizing Genetic Algorithms , 1991 .

[16]  Patrick D. Surry,et al.  Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective , 1995, Computer Science Today.

[17]  Jim Antonisse,et al.  A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint , 1989, ICGA.

[18]  Nicholas J. Radcliffe,et al.  Non-Linear Genetic Representations , 1992, PPSN.

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

[20]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[21]  Gunar E. Liepins,et al.  Deceptiveness and Genetic Algorithm Dynamics , 1990, FOGA.

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

[23]  John J. Grefenstette,et al.  How Genetic Algorithms Work: A Critical Look at Implicit Parallelism , 1989, ICGA.

[24]  Gunar E. Liepins,et al.  Punctuated Equilibria in Genetic Search , 1991, Complex Syst..

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