.png){kind=icon}
.png){kind=icon}
Return
Evolutionary approach for dynamic constrained optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.aej.2022.10.072.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The number of research works on dynamic constrained optimization problems has been increasing rapidly over the past two decades. In this domain, many real-life decision problems need to be solved repeatedly with changing data and parameters. However, no research on dynamic problems with changes in the coefficients of the constraint functions has been reported. In this paper, to deal with such problems, a new evolutionary framework with multiple novel mechanisms is proposed. The new mechanisms are for (1) dealing with both linear and non-linear components in the constraint functions, (2) identifying the rate of change in the coefficients of the variables and (3) updating the population efficiently after every change occurs in the problem. To evaluate the per-formance of the proposed algorithm, we designed a new set of 13 dynamic benchmark problems, each of which consists of 20 dynamic changes and 3 different scenarios. The results demonstrate that the proposed algorithm significantly contributes in achieving good quality solutions, high fea-sibility rates and fast convergence in rapidly changing environments. In addition, the framework shows its capability of using different meta-heuristics to solve dynamic problems.(c) 2022 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/ licenses/by-nc-nd/4.0/).
Keywords:
Dynamic optimization
Constrained optimization
Evolutionary algorithms
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.8
Papers:
6.3K
Citations:
2.6W
Organization
No organization information available