Utilizing the Relationship Between Unconstrained and Constrained Pareto Fronts for Constrained Multiobjective Optimization
提出一种新算法，通过分阶段学习有约束与无约束帕累托前沿的关系，并据此设计进化策略，在65个基准函数和10个实际问题上表现优于或媲美现有方法。
Constrained multiobjective optimization problems (CMOPs) involve multiple objectives to be optimized and various constraints to be satisfied, which challenges the evolutionary algorithms in balancing the objectives and constraints. This article attempts to explore and utilize the relationship between constrained Pareto front (CPF) and unconstrained Pareto front (UPF) to solve CMOPs. Especially, for a given CMOP, the evolutionary process is divided into the learning stage and the evolving stage. The purpose of the learning stage is to measure the relationship between CPF and UPF. To this end, we first create two populations and evolve them by specific learning strategies to approach the CPF and UPF, respectively. Then, the feasibility information and dominance relationship of the two populations are used to determine the relationship. Based on the learned relationship, specific evolving strategies are designed in the evolving stage to improve the utilization efficiency of objective information, so as to better solve this CMOP. By the above process, a new constrained multiobjective evolutionary algorithm (CMOEA) is presented. Comprehensive experimental results on 65 benchmark functions and ten real-world CMOPs show that the proposed method has a better or very competitive performance in comparison with several state-of-the-art CMOEAs. Moreover, this article demonstrates that using the relationship between CPF and UPF to guide the utilization of objective information is promising in solving CMOPs.