An Improved Coevolutionary Algorithm for Constrained Multi-Objective Optimization Problems

Constrained multi-objective optimization problems are ubiquitous in engineering applications. In recent years, constrained multi-objective optimization algorithms based on the dual population coevolutionary framework have been widely studied due to their excellent performance. However, when facing optimization problems with complex constraints, the performance of existing algorithms still needs further improvement. This paper proposes an improved constrained multi-objective coevolutionary algorithm (iCMOCA). The algorithm mainly includes two populations: One population takes into account constraints, while the other population disregards them. Meanwhile, the iCMOCA employs effective collaboration between two populations during the process of offspring generation and environmental selection, and it utilizes an environmental selection strategy based on multi-objective to multi-objective decomposition to improve the performance. Comparative analysis conducted on the DAS-CMOP and MW test suites provides empirical evidence that iCMOCA outperforms five state-of-the-art algorithms.