Two-Stage Cooperation Multiobjective Evolutionary Algorithm Guided by Constraint-Sensitive Variables

Abstract

Constrained multiobjective optimization problems are widespread in practical engineering fields. Scholars have proposed various effective constrained multiobjective evolutionary algorithms (CMOEAs) for such problems. However, most existing algorithms overlook the differences between different decision variables in influencing the degree of constraint violation and still lack an effective handling mechanism for constraint-sensitive variables. To address this issue, a two-stage cooperation multiobjective evolutionary algorithm guided by constraint-sensitive variables (CV-TCMOEA) is proposed. In the first stage, a relatively simple auxiliary problem with only a few dominant constraints is constructed to approximate the original problem. After obtaining a set of approximate Pareto optimal solutions by dealing with the auxiliary problem, in the second stage, a constraint-sensitive variable-guided multistrategy cooperation search method is developed. In this method, decision variables are divided into two types: 1) constraint-sensitive and 2) constraint-insensitive variables, and a variable-type-guided cooperative individual update strategy is proposed to autonomously select appropriate search strategies for different types of variables. Experimental results on 28 benchmark functions and 10 engineering problems demonstrated the superiority of the CV-TCMOEA over seven state-of-the-art CMOEAs.