.png){kind=icon}
.png){kind=icon}
Return
A coevolution algorithm based on two-staged strategy for constrained multi-objective problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-022-03421-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constrained Multiobjective Problem (CMOP) is widely used in engineering applications, but the current constrained Multiobjective Optimization algorithms (CMOEA) often fails to effectively balance convergence and diversity. For this purpose, a two-stage co-evolution constrained multi-objective optimization evolutionary algorithm (TSC-CMOEA) is presented to solve constrained multi-objective optimization problems. This method divides the search process into two phases: in the first stage, the synchronous co-evolution is used, and the population corresponding to the help problem and the population corresponding to the raw problem cooperate with each other and share the offspring to produce better solutions, so as to quickly cross the infeasible region and approach the Pareto front; The second stage discards the help problem when it fails and maintains only the evolution of the main population to save computing resources and enhance convergence. The combination of synchronous co-evolution and staged strategy allows the population to traverse infeasible regions more efficiently and converge quickly to feasible and non-dominant regions. The test results on benchmark CMOPs show that the convergence and population distribution of TSC-CMOEA is significantly better than those of NSGA-II, NSGA-III, C-MOEA/D, PPS, ToP and CCMO.
Keywords:
Constraint handling technique
Multiobjective optimization
Coevolution
Constrained multi-objective evolutionary algorithms
Journal
IF:
3.5
Papers:
7.5K
Citations:
1.7W
View more organizations