Dynamic Auxiliary Task-Based Evolutionary Multitasking for Constrained Multiobjective Optimization
提出一种多任务约束多目标优化框架，通过动态调整约束边界的辅助任务，利用不可行解的知识迁移来提升主任务的求解性能，在54个测试函数和两个实际问题上验证了有效性。
When solving constrained multiobjective optimization problems (CMOPs), the utilization of infeasible solutions significantly affects algorithm’s performance because they not only maintain diversity but also provide promising search directions. In light of this situation, this article proposes a new multitasking-constrained multiobjective optimization (MTCMO) framework, in which a dynamic auxiliary task is created to assist in solving a complex CMOP (the main task) via the knowledge transfer. Moreover, the constraint boundary of the auxiliary task reduces dynamically, so that it keeps a high relatedness with the main task to continuously provide supplementary evolutionary directions. Furthermore, an improved <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> method is designed for the auxiliary task to utilize diverse high-quality infeasible solutions for breaking through infeasible obstacles in the early stage and approaching the feasible boundary from infeasible regions in the later stage. Besides, a new test function with decision space constraints is designed, where one parameter can be adjusted to control the overlap degree between the constrained Pareto front and the unconstrained Pareto front. This function and the other two modified existing functions are used to analyze the characteristics of MTCMO. Finally, compared with 11 state-of-the-art peer methods, the superior or competitive performance of MTCMO is demonstrated on 54 benchmark functions and two real-world applications.