Dual-stage and dual-population cooperative evolutionary algorithm for solving constrained multiobjective problems

During the search process, the characteristics of the feasible regions encountered by the population continually change in Constrained Multiobjective Optimization Problems (CMOPs). This variability poses a challenge for traditional evolutionary algorithms, which often struggle to adapt to the diverse problem characteristics of the encountered feasible regions. To overcome this limitation, we propose a Dual -Stage and Dual -Population Cooperative Evolutionary Algorithm (DDCEA) to address CMOPs characterized by diverse feasible regions. DDCEA employs a dual -stage mechanism to adapt the offspring generation strategy and establishes two distinct populations to evaluate offspring using constraint -sensitive and constraint -free strategies. Comparative analyses reveal that DDCEA surpasses chosen state-of-the-art CMOEAs in adapting to the changing feasible regions and then approximating the constrained Pareto fronts.