.png){kind=icon}
.png){kind=icon}
Return
An effective improved differential evolution algorithm to solve constrained optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-017-2936-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An effective extended differential evolution algorithm is proposed to deal with constrained optimization problems. The proposed algorithm adopts a new mechanism to cope with constrained problems by transforming the equality into inequality first. Then, two kinds of offspring generation approaches are applied to balance the diversity and the convergence speed of the population during evolution, and seven criteria are designed to compare feasible solution over infeasible solution. The performance of the novel algorithm is evaluated on a set of well-known constrained problems from CEC2006. The experimental results are quite competitive when comparing the proposed algorithm against state-of-the-art optimization algorithms.
Keywords:
Differential evolution
Evolutionary algorithm
Mutation strategy
Constrained optimization problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
No organization information available