Combining mutation operators in evolutionary programming

  • Authors:

  • K. Chellapilla

  • Affiliations:

  • Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

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