A mixed mutation strategy evolutionary programming combined with species conservation technique

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mutation operators play an important role in evolutionary programming. Several different mutation operators have been developed in the past decades. However, each mutation operator is only efficient in some type of problems, but fails in another one. In order to overcome the disadvantage, a possible solution is to use a mixed mutation strategy, which mixes various mutation operators. In this paper, an example of such strategies is introduced which employs five different mutation strategies: Gaussian, Cauchy, Levy, single-point and chaos mutations. It also combines with the technique of species conservation to prevent the evolutionary programming from being trapped in local optima. This mixed strategy has been tested on 21 benchmark functions. The simulation results show that the mixed mutation strategy is superior to any pure mutation strategy. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Dong, H., He, J., Huang, H., & Hou, W. (2005). A mixed mutation strategy evolutionary programming combined with species conservation technique. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3789 LNAI, pp. 593–602). https://doi.org/10.1007/11579427_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free