Constrained Multiobjective Optimization Based on Dynamic Priority and Cooperative Offspring Generation

As the number and complexity of constraints in constrained multiobjective optimization problems (CMOPs) increase, the performance of existing constrained multiobjective evolutionary algorithms (CMOEAs) declines significantly. A novel idea is to sequentially address each constraint based on priority, effectively reducing the complexity of CMOPs. However, in these algorithms, the constraint-handling priority is determined statically in the initial stage. This may lead to inappropriate determination of constraint-handling priority since accurately estimating the constraint landscape in the initial stage is quite challenging. Moreover, these algorithms tackle constraints separately, neglecting the potential for interconstraint cooperation and thus compromising their efficiency in constraint handling. Thus, we propose a CMOEA based on dynamic priority and cooperative offspring generation called DPCMOEA. First, the constraint-handling priority is determined dynamically by the estimated inconsistency degree (EID) between the Pareto fronts of the candidate constraints and the current population. Second, computational resources are automatically allocated to each constraint according to EID-based constraint relationship analysis. Finally, a new offspring generation strategy based on constraint cooperation is designed to enhance the quality of new solutions. Experimental results on six CMOP test suites demonstrate that DPCMOEA outperforms six state-of-the-art algorithms.