Investigation of mutation schemes in real-parameter genetic algorithms

Authors:
Debayan Deb;Kalyanmoy Deb
Affiliations:
Department of Computer Science, Michigan State University, East Lansing, MI;Department of Mechanical Engineering, Indian Institute of Technology Kanpur, India
Venue:
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Year:
2012

Citing 5
Cited 0

Swarm intelligence

Swarm intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Completely Derandomized Self-Adaptation in Evolution Strategies

Evolutionary Computation
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the effect of five different mutation schemes for real-parameter genetic algorithms (RGAs). Based on extensive simulation studies, it is observed that a mutation clock implementation is computationally quick and also efficient in finding a solution close to the optimum on four different problems used in this study. Moreover, parametric studies on the polynomial mutation operator identify a working range of values of these parameters. This study signifies that the long-suggested mutation clock operator should be considered as a valuable mutation operator for RGAs.