An analysis of a reordering operator on a GA-hard problem

This paper analyzes the performance of a genetic algorithm that combines reproduction, crossover, and a reordering operator. Reordering operators have often been suggested as one way to avoid thecoding traps — the combinations of loose linkage and deception among important, lower order schemata — of fixed codings. The analysis confirms this role and suggests directions for further research.

[1]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[2]  Albert Donally Bethke,et al.  Genetic Algorithms as Function Optimizers , 1980 .

[3]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[4]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[5]  Stephen F. Smith,et al.  A learning system based on genetic adaptive algorithms , 1980 .

[6]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[7]  D. J. Cavicchio,et al.  Adaptive search using simulated evolution , 1970 .

[8]  John Daniel. Bagley,et al.  The behavior of adaptive systems which employ genetic and correlation algorithms : technical report , 1967 .

[9]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

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

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

[12]  Daniel Raymond Frantz,et al.  Nonlinearities in genetic adaptive search. , 1972 .

[13]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[14]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .