查看文章

Solving multiobjective optimization problems (MOPs) through metaheuristic methods gets considerable attention. Based on the classical variation operators, several enhanced operators, as well as multiobjective optimization evolutionary algorithms, have been developed. Among these operators, the competitive swarm optimizer (CSO) exhibits promising performance. However, it encounters difficulties when tackling constrained MOPs (CMOPs) with large objective spaces or complex infeasible regions. In this article, a competitive and cooperative swarm optimizer is proposed, which contains two particle update strategies: 1) the CSO provides faster convergence speed to accelerate the approximation of the Pareto front and 2) the cooperative swarm optimizer suggests a mutual-learning strategy to enhance the ability to jump out of local feasible regions or local optima. We also present a new algorithm for CMOPs …