A dynamic auxiliary task construction-based evolutionary multitasking algorithm for large-scale multiobjective optimization

Evolutionary multitask optimization shows great potential in large-scale multiobjective optimization problems (LSMOPs) by facilitating knowledge transfer across reduced spaces (constructed as auxiliary tasks). However, existing methods often rely on prior knowledge or fixed variable grouping strategies for constructing these auxiliary tasks, lacking adaptability to problem characteristics and population changes during optimization. Their knowledge transfer mechanisms also frequently lack sufficient guidance, potentially introducing misleading information that hinders the search of the original space (viewed as the main task). To address these challenges, this paper proposes a novel evolutionary algorithm. It first utilizes multiple variable importance evaluation methods to quantify the significance of each decision variable. Based on these evaluations, distinct subsets of critical variables are retained to construct multiple low-dimensional auxiliary tasks that adapt to the current stage of the evolutionary process. This approach concentrates computational resources on key variable groups, thereby accelerating convergence. Furthermore, a reference-solution-guided knowledge transfer strategy is introduced to enhance intertask collaboration. This strategy leverages global elite solutions to provide directional guidance for offspring generation, enabling effective transfer of beneficial knowledge from simpler auxiliary tasks to optimize the main one. Extensive experimental results demonstrate the superior efficiency and effectiveness of the proposed algorithm for solving LSMOPs.

Authors

Institutions

Publication Details

Journal
Complex & Intelligent Systems
Published
2026-02-23
DOI
https://doi.org/10.1007/s40747-025-02175-2
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A dynamic auxiliary task construction-based evolutionary multitasking algorithm for large-scale multiobjective optimization

Zhe Liu, Juanjuan Hong, Pingping Tong, Benyue Su et al.
Complex & Intelligent Systems
Advanced Multi-Objective Optimization Algorithms
article

A dynamic auxiliary task construction-based evolutionary multitasking algorithm for large-scale multiobjective optimization

Zhe Liu, Juanjuan Hong, Pingping Tong, Benyue Su, Fei Han, Jing Jiang
article en

Abstract

Evolutionary multitask optimization shows great potential in large-scale multiobjective optimization problems (LSMOPs) by facilitating knowledge transfer across reduced spaces (constructed as auxiliary tasks). However, existing methods often rely on prior knowledge or fixed variable grouping strategies for constructing these auxiliary tasks, lacking adaptability to problem characteristics and population changes during optimization. Their knowledge transfer mechanisms also frequently lack sufficient guidance, potentially introducing misleading information that hinders the search of the original space (viewed as the main task). To address these challenges, this paper proposes a novel evolutionary algorithm. It first utilizes multiple variable importance evaluation methods to quantify the significance of each decision variable. Based on these evaluations, distinct subsets of critical variables are retained to construct multiple low-dimensional auxiliary tasks that adapt to the current stage of the evolutionary process. This approach concentrates computational resources on key variable groups, thereby accelerating convergence. Furthermore, a reference-solution-guided knowledge transfer strategy is introduced to enhance intertask collaboration. This strategy leverages global elite solutions to provide directional guidance for offspring generation, enabling effective transfer of beneficial knowledge from simpler auxiliary tasks to optimize the main one. Extensive experimental results demonstrate the superior efficiency and effectiveness of the proposed algorithm for solving LSMOPs.

Complex & Intelligent SystemsVol. 12(3)
Jiangsu University (CN), National Science Centre (PL), Tongling University (CN), Anqing Normal University (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 45%
Advanced Multi-Objective Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.