A new differential evolution algorithm with a combined mutation strategy
What is it about?
A new differential evolution (DE) algorithm with a combined mutation strategy, termed the CMDE algorithm, is proposed. In the combined mutation strategy the DE/best/1 operator and the DE/current-to-best/1 operator are respectively executed on some superior parents and some mediocre parents, and the DE/rand/1 operator is executed on the other inferior parents. In addition, the individuals participating in the three mutation operators are randomly selected from the entire set of parents. The proposed CMDE algorithm with the three different search modes possesses better population diversity as well as search ability than the classic DE algorithm.
Why is it important?
Effectively and efficiently solve difficult optimization problem, e.g., one-phase path synthesis problems of linkage mechanisms
The following have contributed to this page: Professor Wen-Yi Lin
In partnership with: