.png){kind=icon}
Return
A modified differential evolution algorithm for unconstrained optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.04.036.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A modified differential evolution algorithm (MDE) is proposed to solve unconstrained optimization problems in this paper. Gauss distribution and uniform distribution have one thing in common, that is randomness or indeterminateness. Due to this characteristic, MDE employs both distributions to adjust scale factor and crossover rate, which is useful to increase the diversity of the entire population. To guarantee the quality of the swarm, MDE uses an external archive, and some solutions of high quality in this external archive can be selected for candidate solutions. MDE adopts two common mutation strategies to produce new solutions, and the information of global best solution is more likely to be utilized for the mutation during late evolution process, which is beneficial to improving the convergence of the proposed algorithm. In addition, a central solution is generated in terms of all the other candidate solutions, and it can provide a potential searing direction. Experimental results show that MDE algorithm can yield better objective function values than the other six DE algorithms for some unconstrained optimization problems, thus it is an efficient alternative on solving unconstrained optimization problems. (c) 2013 Elsevier B.V. All rights reserved.
Keywords:
Modified differential evolution algorithm
Gauss distribution
Uniform distribution
External archive
Mutation
Central solution
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave View more