Evolutionary Dynamic Multi-Objective Optimization With Learning Across Problems

Dynamic multi-objective optimization problems (DMOPs) are prevalent in many practical applications and have garnered significant attention from both industry and academia, leading to the proposal of numerous dynamic multi-objective optimization algorithms. Among these approaches, learning-and prediction-based evolutionary approaches have achieved remarkable success due to their fast learning and strong optimization capabilities when dynamic occurs. However, existing methods typically focus on learning and transferring knowledge within a single problem, often relying on historical knowledge to aid the optimization process. This could limit the data available for developing a more general prediction model for dynamic optimization. The potential for leveraging knowledge across different DMOPs to enhance problem-solving efficiency and effectiveness remains largely unexplored. Building on this insight, this paper explores the solution of DMOPs with learning not only within a single problem but also across different problems. In particular, by performing dynamic feature extraction and task-specific solution classification, we propose to construct a centralized learning model that captures the correlations across DMOPs and the corresponding optimized solutions. This approach allows optimization data from multiple problems to be effectively utilized, enabling the learning of dynamic knowledge to enhance evolutionary optimization when a change occurs. To assess the effectiveness of the proposed algorithm, extensive empirical studies have been conducted on the commonly used DMOP benchmarks with fixed and shifty dynamic settings. The numerical results demonstrate the effectiveness of the proposed algorithm in recognizing more general change patterns of DMOPs, showcasing its superiority compared to the existing state-of-the-art learning and prediction-based approaches.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Evolutionary Computation
Published
2025-01-01
DOI
https://doi.org/10.1109/tevc.2025.3596468
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

Evolutionary Dynamic Multi-Objective Optimization With Learning Across Problems

Zexuan Zhu, Yuling Xie, Quanwu Zhao, Wei Zhou
IEEE Transactions on Evolutionary Computation
Advanced Multi-Objective Optimization Algorithms
article

Evolutionary Dynamic Multi-Objective Optimization With Learning Across Problems

Zexuan Zhu, Yuling Xie, Quanwu Zhao, Wei Zhou
article en

Abstract

Dynamic multi-objective optimization problems (DMOPs) are prevalent in many practical applications and have garnered significant attention from both industry and academia, leading to the proposal of numerous dynamic multi-objective optimization algorithms. Among these approaches, learning-and prediction-based evolutionary approaches have achieved remarkable success due to their fast learning and strong optimization capabilities when dynamic occurs. However, existing methods typically focus on learning and transferring knowledge within a single problem, often relying on historical knowledge to aid the optimization process. This could limit the data available for developing a more general prediction model for dynamic optimization. The potential for leveraging knowledge across different DMOPs to enhance problem-solving efficiency and effectiveness remains largely unexplored. Building on this insight, this paper explores the solution of DMOPs with learning not only within a single problem but also across different problems. In particular, by performing dynamic feature extraction and task-specific solution classification, we propose to construct a centralized learning model that captures the correlations across DMOPs and the corresponding optimized solutions. This approach allows optimization data from multiple problems to be effectively utilized, enabling the learning of dynamic knowledge to enhance evolutionary optimization when a change occurs. To assess the effectiveness of the proposed algorithm, extensive empirical studies have been conducted on the commonly used DMOP benchmarks with fixed and shifty dynamic settings. The numerical results demonstrate the effectiveness of the proposed algorithm in recognizing more general change patterns of DMOPs, showcasing its superiority compared to the existing state-of-the-art learning and prediction-based approaches.

IEEE Transactions on Evolutionary Computation
Chongqing Technology and Business University (CN), Chongqing University (CN), Shenzhen Technology University (CN)
Openalex Percentile: Top 79%
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.