.png){kind=icon}
.png){kind=icon}
Return
A differential evolution algorithm with intersect mutation operator
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2012.08.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a novel differential evolution (DE) algorithm with intersect mutation operation called intersect mutation differential evolution (IMDE) algorithm. Instead of focusing on setting proper parameters, in IMDE algorithm, all individuals are divided into the better part and the worse part according to their fitness. And then, the novel mutation and crossover operations have been developed to generate the new individuals. Finally, a set of famous benchmark functions have been used to test and evaluate the performance of the proposed IMDE. The experimental results show that the proposed algorithm is better than, or at least comparable to the self-adaptive DE (JDE), which is proven to be better than the standard DE algorithm. In further study, the IMDE algorithm has also been compared with several improved Particle Swarm Optimization (PSO) algorithms, Artificial Bee Colony (ABC) algorithm and Bee Swarm Optimization (BSO) algorithm. And the IMDE algorithm outperforms these algorithms. (C) 2012 Elsevier B. V. All rights reserved.
Keywords:
Differential evolution (DE)
Intersect mutation operation
Global search
Local search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
No organization information available