A Comparative Study of Adaptive Mutation Operators for Genetic Algorithms

Genetic algorithms (GAs) are a class of stochastic optimization methods inspired by the principles of natural evolution. Adaptation of strategy parameters and genetic operators has become an important and promising research area in GAs. Many researchers are applying adaptive techniques to guide the search of GAs toward optimum solutions. Mutation is a key component of GAs. It is a variation operator to create diversity for GAs. This paper investigates several adaptive mutation operators, including population level adaptive mutation operators and gene level adaptive mutation operators, for GAs and compares their performance based on a set of uni-modal and multi-modal benchmark problems. The experimental results show that the gene level adaptive mutation operators are usually more efficientthan the population level adaptive mutation operators for GAs.

[1]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[2]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

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

[5]  Shengxiang Yang,et al.  Adaptive mutation with fitness and allele distribution correlation for genetic algorithms , 2006, SAC.

[6]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[7]  A. Sima Etaner-Uyar,et al.  A Gene Based Adaptive Mutation Strategy for Genetic Algorithms , 2004, GECCO.

[8]  Dirk Thierens,et al.  Adaptive Strategies for Operator Allocation , 2007, Parameter Setting in Evolutionary Algorithms.

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

[10]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

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

[12]  Tzung-Pei Hong,et al.  Simultaneously Applying Multiple Mutation Operators in Genetic Algorithms , 2000, J. Heuristics.

[13]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[14]  Changhe Li,et al.  An adaptive mutation operator for particle swarm optimization , 2008 .

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

[16]  Lishan Kang,et al.  An Adaptive Evolutionary Algorithm for Numerical Optimization , 1996, SEAL.

[17]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .

[18]  Jim Smith,et al.  Self adaptation of mutation rates in a steady state genetic algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[19]  Shengxiang Yang,et al.  Adaptive Mutation Using Statistics Mechanism for Genetic Algorithms , 2003, SGAI Conf..

[20]  Dirk Thierens,et al.  An Adaptive Pursuit Strategy for Allocating Operator Probabilities , 2005, BNAIC.

[21]  Peter J. Angeline,et al.  Adaptive and Self-adaptive Evolutionary Computations , 1995 .