.png){kind=icon}
Return
Dynamic-multi-task-assisted evolutionary algorithm for constrained multi-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101683.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Compared with common multi-objective optimization problems, constrained multi-objective optimization problems demand additional consideration of the treatment of constraints. Recently, many constrained multiobjective evolutionary algorithms have been presented to reconcile the relationship between constraint satisfaction and objective optimization. Notably, evolutionary multi-task mechanisms have also been exploited in solving constrained multi-objective problems frequently with remarkable outcomes. However, previous methods are not fully applicable to solving problems possessing all types of constraint landscapes and are only superior for a certain type of problem. Thus, in this paper, a novel dynamic-multi-task-assisted constrained multi-objective optimization algorithm, termed DTCMO, is proposed, and three dynamic tasks are involved. The main task approaches the constrained Pareto front by adding new constraints dynamically. Two auxiliary tasks are devoted to exploring the unconstrained Pareto front and the constrained Pareto front with dynamically changing constraint boundaries, respectively. In addition, the first auxiliary task stops the evolution automatically after reaching the unconstrained Pareto front, avoiding the waste of subsequent computational resources. A series of experiments are conducted with eight mainstream algorithms on five benchmark problems, and the results confirm the generality and superiority of DTCMO.
Keywords:
Constrained multi-objective optimization
Dynamic task
Evolutionary algorithm
Multi-task
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
View more organizations
Cited Papers
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSaveShareSaveShareSave View more