.png){kind=icon}
.png){kind=icon}
Return
Constraint-handling techniques within differential evolution for solving process engineering problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2021.107442.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A wide range of process systems engineering problems involve an optimisation formulation that is difficult to solve due to sources of discontinuity and non-convexity and a high number of constraints to satisfy. Differential Evolution algorithm (DE) has proven to be robust for the solution of highly non-convex and mixed-integer problems; nevertheless, its performance greatly depends on the constraint-handling technique used. In this study, numerical comparisons of some state-of-the-art constraint-handling techniques are performed: static penalty function, stochastic ranking, feasibility rules, epsilon constrained method and gradient-based repair. The obtained results show that the gradient-based repair technique deserves a special attention when solving highly constrained problems. This technique enables to efficiently satisfy both inequality and equality constraints, which makes it particularly adapted for the solution of process engineering optimization problems. (C) 2021 Published by Elsevier B.V.
Keywords:
ADAPTIVE PENALTY-FUNCTION
GLOBAL OPTIMIZATION
STOCHASTIC RANKING
GENETIC ALGORITHMS
DESIGN
SEARCH
STRATEGY
FRAMEWORK
SELECTION
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