Optimization problems in real-world applications often involve dynamic environmental changes, requiring algorithms to adapt quickly, track optimal solutions, and maintain efficiency. Existing dynamic multiobjective optimization evolutionary algorithms (DMOEAs) typically rely on fixed or limited dynamic response mechanisms, which are often insufficient to handle complex and varied dynamic environments. To overcome these limitations, this article proposes an adaptive dynamic response-based DMOEA (ADR-DMOEA), which employs a subpopulation-level adaptive mechanism to coordinate diversity-driven, prediction-driven, and memory-driven strategies. The strategy weights are dynamically adjusted according to the static optimization distance of each subpopulation, ensuring that appropriate strategies are adaptively deployed in different environments. This design overcomes the inefficiency of fixed assignments and the instability of individual-level perturbations, enabling coordinated and stable evolution. Extensive experiments on DF benchmark functions and a blast furnace (BF) ironmaking case study demonstrate that ADR-DMOEA achieves superior convergence, diversity, and robustness compared to state-of-the-art algorithms, effectively supporting real-world decision-making under dynamic conditions.
Wang et al. (Thu,) studied this question.