Multi-operator evolutionary programming: A preliminary study on function optimization
Classical evolutionary programming uses Gaussian mutation as the primary search operator. Recent studies have shown that using a Cauchy random variable as the primary operator leads to faster convergence for certain function optimization problems. In this study we explore the use of both the Gaussian and the Cauchy operators along with a self-adaptive mechanism to select the appropriate operator for each individual in the population. Empirical studies of the dual-operator evolutionary programming are conducted using a limited set of test function optimization problems.
Unable to display preview. Download preview PDF.
- T. Bäck and H.-P. Schwefel (1993) “An overview of evolutionary algorithms for parameter optimization,” Evolutionary Computation, Vol. 1, No. 1, pp. 1–24.Google Scholar
- D.B. Fogel (1995) Evolutionary Computation: Towards a New Philosophy of Machine Intelligence, IEEE Press, NYGoogle Scholar
- X. Yao and Y. Liu (1996) “Fast Evolutionary Programming,” Evolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming, L.J. Fogel, P.J. Angeline, and T. Back (eds.), MIT Press, Cambridge, MA, pp. 451–460.Google Scholar