Fusion prediction strategy-based dynamic multi-objective sparrow search algorithm

Rui Wu

doi:10.1016/j.asoc.2024.112071

Return

Fusion prediction strategy-based dynamic multi-objective sparrow search algorithm

2024-11-01

PRE

DOI：10.1016/j.asoc.2024.112071

Original

Original request for help

Save

Abstract

En 中文

Solving dynamic multi-objective optimization problems with time-varying Pareto front (PF) or Pareto set (PS) is a challenging task. Such problems require algorithms to react to environmental changes and efficiently track optimal solutions. For this purpose, a dynamic multi-objective sparrow search algorithm (SSA) with fusion prediction strategy, based on difference model and kernel extreme learning machine (DMOSSA-FPS), is proposed. Given the diversity of change characteristics, a single prediction model is insufficient. Therefore, based on the historical information of the population, a difference model and a kernel extreme learning machine are integrated for PS prediction. The former is used to predict the solutions of some individuals under approximate linear changes and the latter is employed for nonlinear predictions. In a new environment, the combined predictions increase the diversity of the initial population. Additionally, a new static optimizer is proposed, which combines decomposition- and dominance-based approaches to constitute a new individual screening mechanism. Then the optimization mode of SSA is introduced to enhance both algorithmic diversity and convergence rate. The experimental results on the DF test suite demonstrate that, compared with several other advanced algorithms, DMOSSA-FPS exhibits stronger convergence and robustness.

Keywords:

Dynamic multi-objective optimization

Dominance degree sorting

Sparrow Search Algorithm

Kernel Extreme Learning Machine

Fusion prediction strategy