OMEGA - Ordering Messy GA: Solving Permutation Problems with the Fast Genetic Algorithm and Random Keys

This paper presents an ordering messy genetic algorithm (OmeGA) that is able to solve difficult permutation problems efficiently. It is essentially a fast messy genetic algorithm (fmGA) using random keys to represent chromosomes. Experimental results that show the random key-based simple genetic algorithm (RKGA) being outperformed by its messy competitor in 32-length ordering deceptive problems are presented.

[1]  L. Darrell Whitley,et al.  Modeling Simple Genetic Algorithms for Permutation Problems , 1994, FOGA.

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

[3]  David E. Goldberg Using Time Efficiently: Genetic-Evolutionary Algorithms and the Continuation Problem , 1999, GECCO.

[4]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[5]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[6]  Gang Wang,et al.  Revisiting the GEMGA: scalable evolutionary optimization through linkage learning , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

[8]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

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

[10]  Sushil J. Louis,et al.  Designer Genetic Algorithms: Genetic Algorithms in Structure Design , 1991, ICGA.

[11]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[12]  H. Kargupta Search, polynomial complexity, and the fast messy genetic algorithm , 1996 .

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

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

[15]  G. Harik Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .

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

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

[18]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale , 1990, Complex Syst..

[19]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[20]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[21]  Zbigniew Michalewicz,et al.  An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms , 1991, ICGA.