Back to Search
Start Over
Evolutionary programming using a mixed mutation strategy
- Source :
-
Information Sciences . Jan2007, Vol. 177 Issue 1, p312-327. 16p. - Publication Year :
- 2007
-
Abstract
- Abstract: Different mutation operators have been proposed in evolutionary programming, but for each operator there are some types of optimization problems that cannot be solved efficiently. A mixed strategy, integrating several mutation operators into a single algorithm, can overcome this problem. Inspired by evolutionary game theory, this paper presents a mixed strategy evolutionary programming algorithm that employs the Gaussian, Cauchy, Lévy, and single-point mutation operators. The novel algorithm is tested on a set of 22 benchmark problems. The results show that the mixed strategy performs equally well or better than the best of the four pure strategies does, for all of the benchmark problems. [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*GAME theory
*MATHEMATICAL models
*FOUNDATIONS of arithmetic
Subjects
Details
- Language :
- English
- ISSN :
- 00200255
- Volume :
- 177
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Information Sciences
- Publication Type :
- Periodical
- Accession number :
- 22796843
- Full Text :
- https://doi.org/10.1016/j.ins.2006.07.014