Proposes a scalable benchmark for DMOPs with changing objective counts by dynamically selecting subsets from fixed Minus-DTLZ and Minus-WFG problems to isolate the effect of objective number dynamics.
ACM Computing Surveys55(4), 76:1–76:47 (2023)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Scalable Benchmark Test Suite for Dynamic Multi-Objective Optimization with a Changing Number of Objectives
Proposes a scalable benchmark for DMOPs with changing objective counts by dynamically selecting subsets from fixed Minus-DTLZ and Minus-WFG problems to isolate the effect of objective number dynamics.