Two new mutation operators for enhanced search and optimization in evolutionary programming

Kumar Chellapilla, David B. Fogel · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1997

Evolutionary programming (EP) has been successfully applied to many parameter optimization problems. We propose a mean mutation operator, consisting of a linear combination of Gaussian and Cauchy mutations. Preliminary results indicate that both the adaptive and non-adaptive versions of the mean mutation operator are capable of producing solutions that are as good as, or better than those produced by Gaussian mutations alone. The success of the adaptive operator could be attributed to its ability to self-adapt the shape of the probability density function that generates the mutations during the run.

Read the paper · More papers on PaperTik