Combining mutation operators in evolutionary programming
- 1 September 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 2 (3) , 91-96
- https://doi.org/10.1109/4235.735431
Abstract
Traditional investigations with evolutionary programming for continuous parameter optimization problems have used a single mutation operator with a parametrized probability density function (PDF), typically a Gaussian. Using a variety of mutation operators that can be combined during evolution to generate PDFs of varying shapes could hold the potential for producing better solutions with less computational effort. In view of this, a linear combination of Gaussian and Cauchy mutations is proposed. Simulations indicate that both the adaptive and nonadaptive versions of this operator are capable of producing solutions that are statistically as good as, or better, than those produced when using Gaussian or Cauchy mutations alone.Keywords
This publication has 7 references indexed in Scilit:
- Local convergence rates of simple evolutionary algorithms with Cauchy mutationsIEEE Transactions on Evolutionary Computation, 1997
- Evolutionary Algorithms in Theory and PracticePublished by Oxford University Press (OUP) ,1996
- A comparison of methods for self-adaptation in evolutionary algorithmsBiosystems, 1995
- Global OptimizationPublished by Springer Nature ,1989
- A Connectionist Machine for Genetic HillclimbingPublished by Springer Nature ,1987
- Nonconvex optimization by fast simulated annealingProceedings of the IEEE, 1987
- Generalized descent for global optimizationJournal of Optimization Theory and Applications, 1981