Modeling Simple Genetic Algorithms for Permutation Problems

Abstract An exact model of a simple genetic algorithm is developed for permutation based representations. Permutation based representations are used for scheduling problems and combinatorial problems such as the Traveling Salesman Problem. A remapping function is developed to remap the model to all permutations in the search space. The mixing matrices for various permutation based operators are also developed.

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

[2]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

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

[4]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[5]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

[6]  Kalyanmoy Deb,et al.  Ordering Genetic Algorithms and Deception , 1992, PPSN.

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

[8]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[9]  L. Darrell Whitley,et al.  An Executable Model of a Simple Genetic Algorithm , 1992, FOGA.

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

[11]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

[13]  David E. Goldberg,et al.  An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm , 1987, ICGA.

[14]  Alden H. Wright,et al.  Stability of Vertex Fixed Points and Applications , 1994, FOGA.

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

[16]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.