.png){kind=icon}
.png){kind=icon}
Return
A Dynamic Interval Multiobjective Evolutionary Algorithm Based on Multitask Learning and Inverse Mapping
.png){kind=icon}
PRE
AI
F
J
X
D
G
Y
DOI：10.1109/TEVC.2025.3551355.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic interval multiobjective optimization problems, such as those encountered in wireless sensor network scheduling and portfolio selection, are increasingly prevalent. However, they present significant challenges due to the inherent uncertainty and variability of their parameters. This article proposes a dynamic interval multiobjective evolutionary algorithm in terms of multitask learning and inverse mapping. The algorithm employs an interval-based MOEA/D as its foundational framework. Upon encountering environmental changes, prediction models for the midpoints and widths of intervals are developed using multitask learning combined with a self-evolving fuzzy system. These models generate a predicted Pareto front (PF) in the objective space. Subsequently, inverse mappings of the objective functions at the new time are established to identify solutions that correspond to the predicted PF in the decision space. Finally, these solutions are expanded to form an initial population at the new time. Testing on 18 benchmark optimization problems and an uncertain scheduling of underwater wireless sensor networks, the proposed algorithm demonstrates both competitiveness and superiority when compared to five state-of-the-art algorithms.
Keywords:
Dynamic multiobjective optimization
interval
least square inverse mapping
multitask learning
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
Cited Papers