Benchmarking continuous dynamic multi-objective optimization: Survey and generalized test suite

The field of Dynamic Multi-Objective Optimization (DMOO) has witnessed a surge of interest from both academia and industry, as numerous time-evolving real-world applications can be naturally formulated as Dynamic Multi-Objective Optimization Problems (DMOPs). This growing demand thus necessitates advanced benchmarks to rigorously evaluate optimization algorithms under realistic conditions. This paper introduces a comprehensive and principled framework for constructing highly realistic and challenging DMOO benchmarks. The proposed framework incorporates several novel components, including: a generalized formulation that allows the Pareto-optimal Set (PS) to change on hypersurfaces; a mechanism for creating controlled variable contribution imbalances to generate heterogeneous landscapes; and dynamic rotation matrices for inducing time-varying variable interactions and non-separability. Furthermore, we incorporate a temporal perturbation mechanism to simulate irregular environmental changes and propose a generalized time-linkage mechanism that systematically embeds historical solution quality into future problems, thereby capturing critical real-world phenomena such as error accumulation and time-deception. Extensive experimental results validate the effectiveness of the proposed framework, demonstrating its superiority over conventional benchmarks in terms of realism, complexity, and its capability for discriminating state-of-the-art algorithmic performance. Thus, this work establishes a new standard for dynamic multi-objective optimization benchmarking and provides a powerful tool for the development and evaluation of next-generation algorithms capable of addressing the complexities of real-world dynamic systems. • Proposes a novel, comprehensive framework for generating highly realistic DMOO benchmarks. • Introduces hypersurface-based Pareto Set changes, controlled imbalance, and dynamic rotation. • Incorporates irregular temporal perturbations and a generalized time-linkage mechanism. • Establishes a new DMOO benchmark standard and demonstrates algorithm discrimination effectiveness.

Authors

Institutions

Publication Details

Journal
Swarm and Evolutionary Computation
Published
2026-03-23
DOI
https://doi.org/10.1016/j.swevo.2026.102361
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

Benchmarking continuous dynamic multi-objective optimization: Survey and generalized test suite

Shi Cheng, Nana Pu, Chang Shao, Yuhui Shi et al.
Swarm and Evolutionary Computation
Advanced Multi-Objective Optimization Algorithms
article

Benchmarking continuous dynamic multi-objective optimization: Survey and generalized test suite

Shi Cheng, Nana Pu, Chang Shao, Yuhui Shi, Qi Zhao, Jing Jiang
article en

Abstract

The field of Dynamic Multi-Objective Optimization (DMOO) has witnessed a surge of interest from both academia and industry, as numerous time-evolving real-world applications can be naturally formulated as Dynamic Multi-Objective Optimization Problems (DMOPs). This growing demand thus necessitates advanced benchmarks to rigorously evaluate optimization algorithms under realistic conditions. This paper introduces a comprehensive and principled framework for constructing highly realistic and challenging DMOO benchmarks. The proposed framework incorporates several novel components, including: a generalized formulation that allows the Pareto-optimal Set (PS) to change on hypersurfaces; a mechanism for creating controlled variable contribution imbalances to generate heterogeneous landscapes; and dynamic rotation matrices for inducing time-varying variable interactions and non-separability. Furthermore, we incorporate a temporal perturbation mechanism to simulate irregular environmental changes and propose a generalized time-linkage mechanism that systematically embeds historical solution quality into future problems, thereby capturing critical real-world phenomena such as error accumulation and time-deception. Extensive experimental results validate the effectiveness of the proposed framework, demonstrating its superiority over conventional benchmarks in terms of realism, complexity, and its capability for discriminating state-of-the-art algorithmic performance. Thus, this work establishes a new standard for dynamic multi-objective optimization benchmarking and provides a powerful tool for the development and evaluation of next-generation algorithms capable of addressing the complexities of real-world dynamic systems. • Proposes a novel, comprehensive framework for generating highly realistic DMOO benchmarks. • Introduces hypersurface-based Pareto Set changes, controlled imbalance, and dynamic rotation. • Incorporates irregular temporal perturbations and a generalized time-linkage mechanism. • Establishes a new DMOO benchmark standard and demonstrates algorithm discrimination effectiveness.

Swarm and Evolutionary ComputationVol. 104
University of Technology Sydney (AU), Southern University of Science and Technology (CN), Chengdu University of Technology (CN), Shaanxi Normal University (CN)
Reduced inequalities
Openalex Percentile: Top 10%
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.