Optimal mutation probability for genetic algorithms

Authors:
R. N. Greenwell;J. E. Angus;M. Finck
Affiliations:
Hofstra University Hempstead, NY 11550, U.S.A.;Department of Mathematics The Claremont Graduate School 143 E. Tenth St., Claremont, CA 91711, U.S.A.;Hofstra University Hempstead, NY 11550, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1995

Citing 5
Cited 0

Optimization of control parameters for genetic algorithms

IEEE Transactions on Systems, Man and Cybernetics
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
When Both Individuals and Populations Search: Adding Simple Learning to the Genetic Algorithm

Proceedings of the 3rd International Conference on Genetic Algorithms
Varying the Probability of Mutation in the Genetic Algorithm

Proceedings of the 3rd International Conference on Genetic Algorithms
A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms

Quantified Score

Hi-index	0.98

Visualization

Abstract

We derive the value of the mutation probability which maximizes the probability that the genetic algorithm finds the optimum value of the objective function under simple assumptions. This value is compared with the optimum mutation probability derived in other studies. An empirical study shows that this value, when used with a larger scaling factor in linear scaling, improves the performance of the genetic algorithm. This feature is then added to a model developed by Hinton and Nowlan which allows certain bits to be guessed in an effort to increase the probability of finding the optimum solution.