返回
Coevolutionary multitasking for constrained multiobjective optimization
DOI:10.1016/j.swevo.2024.101727.png)
摘要
En 中文
Addressing the challenges of constrained multiobjective optimization problems (CMOPs) with evolutionary algorithms requires balancing constraint satisfaction and optimization objectives. Coevolutionary multitasking (CEMT) offers a promising strategy by leveraging synergies from distinct, complementary tasks. The primary challenge in CEMT frameworks is constructing suitable auxiliary tasks that effectively complement the main CMOP task. In this paper, we propose an adaptive CEMT framework (ACEMT), which customizes two adaptive auxiliary tasks to enhance CMOP-solving efficiency. The first auxiliary task dynamically narrows constraint boundaries, facilitating exploration in regions with smaller feasible spaces. The second task focuses specifically on individual constraints, continuously adapting to expedite convergence and uncover optimal regions. In solving the main CMOP task, this dual-auxiliary-task strategy not only improves search thoroughness but also clarifies the balance between constraints and objectives. Concretely, ACEMT incorporates an adaptive constraint relaxation technique for the first auxiliary task and a specialized constraint selection strategy for the second. These innovations foster effective knowledge transfer and task synergy, addressing the key challenge of auxiliary task construction in CEMT frameworks. Extensive experiments on three benchmark suites and real-world applications demonstrate ACEMT's superior performance compared to state-of-the-art constrained evolutionary algorithms. ACEMT sets a new standard in CMOP-solving by strategically constructing and adapting auxiliary tasks, representing a significant advancement in this research direction.
Keyword:
Constrained multiobjective optimization
Coevolutionary multitasking
Adaptive auxiliary tasks
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法

