.png){kind=icon}
.png){kind=icon}
Return
Many-objective optimization with dynamic constraint handling for constrained optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-016-2286-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In real-world applications, the optimization problems are usually subject to various constraints. To solve constrained optimization problems (COPs), this paper presents a new methodology, which incorporates a dynamic constraint handling mechanism into many-objective evolutionary optimization. Firstly we convert a COP into a dynamic constrained many-objective optimization problem (DCMaOP), which is equivalent to the COP, then the proposed many-objective optimization evolutionary algorithm with dynamic constraint handling, called MaDC, is realized to solve the DCMaOP. MaDC uses the differential evolution (DE) to generate individuals, and a reference-point-based nondominated sorting approach to select individuals. The effectiveness of MaDC is verified on 22 test instances. The experimental results show that MaDC is competitive to several state-of-the-art algorithms, and it has better global search ability than its peer algorithms.
Keywords:
Constrained optimization
Many-objective optimization
Dynamic constraint optimization
Reference-point-based nondominated sorting
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