Adapting Operator Settings in Genetic Algorithms

In the majority of genetic algorithm implementations, the operator settings are fixed throughout a given run. However, it has been argued that these settings should vary over the course of a genetic algorithm runso as to account for changes in the ability of the operators to produce children of increased fitness. This paper describes an investigation into this question. The effect upon genetic algorithm performance of two adaptation methods upon both well-studied theoretical problems and a hard problem from operations research, the flowshop sequencing problem, are therefore examined. The results obtained indicate that the applicability of operator adaptation is dependent upon three basic assumptions being satisfied by the problem being tackled.

[1]  C. Igel,et al.  Using fitness distributions to improve the evolution of learning structures , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

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

[4]  Bryant A. Julstrom,et al.  What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm , 1995, ICGA.

[5]  Peter Ross,et al.  The Phase-Transition Niche for Evolutionary Algorithms in Timetabling , 1995, PATAT.

[6]  Heinz Mühlenbein,et al.  Analysis of Selection, Mutation and Recombination in Genetic Algorithms , 1995, Evolution and Biocomputation.

[7]  Thomas Bäck,et al.  The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm , 1992, PPSN.

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

[9]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[10]  Reinhard Männer,et al.  Towards an Optimal Mutation Probability for Genetic Algorithms , 1990, PPSN.

[11]  Thomas Bck,et al.  Self-adaptation in genetic algorithms , 1991 .

[12]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[13]  Kalyanmoy Deb,et al.  Long Path Problems , 1994, PPSN.

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

[15]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[16]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

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

[18]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[19]  In Schoenauer,et al.  Parallel Problem Solving from Nature , 1990, Lecture Notes in Computer Science.

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

[21]  Reinhard Männer,et al.  Parallel Problem Solving from Nature 2, PPSN-II, Brussels, Belgium, September 28-30, 1992 , 1992, Parallel Problem Solving from Nature.

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

[23]  Jim Smith,et al.  Operator and parameter adaptation in genetic algorithms , 1997, Soft Comput..

[24]  R. Hinterding.  Representation and self-adaption in genetic algorithms , 1996 .

[25]  Peter Ross,et al.  Fast Practical Evolutionary Timetabling , 1994, Evolutionary Computing, AISB Workshop.

[26]  Tim Jones.  Evolutionary Algorithms, Fitness Landscapes and Search , 1995 .

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

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

[29]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

[30]  L. D. Whitley,et al.  Genetic Reinforcement Learning for Neurocontrol Problems , 2004, Machine Learning.

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

[32]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .

[33]  A. Rosenfeld,et al.  IEEE TRANSACTIONS ON SYSTEMS , MAN , AND CYBERNETICS , 2022 .

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

[35]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[36]  Zbigniew Michalewicz,et al.  Self-Adaptive Genetic Algorithm for Numeric Functions , 1996, PPSN.

[37]  Colin R. Reeves,et al.  Are Long Path Problems Hard for Genetic Algorithms? , 1996, PPSN.

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

[39]  F. Landy.  What have you done for me Lately , 1982 .

[40]  Kenneth A. De Jong,et al.  Genetic Algorithms are NOT Function Optimizers , 1992, FOGA.

[41]  David B. Fogel,et al.  Evolutionary algorithms in theory and practice , 1997, Complex.