Analysing mutation schemes for real-parameter genetic algorithms

Authors:
Kalyanmoy Deb;Debayan Deb
Affiliations:
Department of Electrical and Computer Engineering, Michigan State University, 428 S. Shaw Lane, 2120 EB, East Lansing, MI 48824, USA;Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824, USA
Venue:
International Journal of Artificial Intelligence and Soft Computing
Year:
2014

Citing 7
Cited 0

Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
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
A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms
Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Fuzzy Recombination for the Breeder Genetic Algorithm

Proceedings of the 6th International Conference on Genetic Algorithms
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mutation is an important operator in genetic algorithms GAs, as it ensures maintenance of diversity in evolving populations of GAs. Real-parameter GAs RGAs handle real-valued variables directly without going to a binary string representation of variables. Although RGAs were first suggested in early '90s, the mutation operator is still implemented variable-wise - in a manner that is independent to each variable. In this paper, we investigate the effect of five different mutation schemes for RGAs using two different mutation operators - polynomial and Gaussian mutation operators. 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 for both mutation operators. Moreover, parametric studies with their associated parameters reveal suitable working ranges of the parameters. Interestingly, both mutation operators with their respective optimal parameter settings are found to possess a similar inherent probability of offspring creation, a matter that is believed to be the reason for their superior working. This study signifies that the long suggested mutation clock operator should be considered as a valuable mutation operator for RGAs.