A fast density peak clustering based particle swarm optimizer for dynamic optimization

doi:10.1016/j.eswa.2023.121254

A fast density peak clustering based particle swarm optimizer for dynamic optimization

2024-02-01

10

PRE

AI

DOI：10.1016/j.eswa.2023.121254

Original

Original request for help

Save

Abstract

En 中文

Dynamic optimization problems (DOPs) are optimization problems with time evolution characteristics. In this type of problem, the decision variables and the state variables change over time and produce results that will impact the future. To effectively address DOPs, this paper proposes a fast density peak clustering based particle swarm optimizer for dynamic optimization (DPCPSO). The main innovations of DPCPSO contain three critical components. First, a fast density peak clustering is applied to create multiple sub-populations, which can help the algorithm locate peaks. Second, stagnation detection is used to tackle the loss of diversity. Third, an optimal particle calibration strategy which can find the optimal solution quickly in a changing environment is proposed in response to environmental changes. Moreover, the hill climbing method is applied to help the memory quickly locate new peaks if the environment changes. The performance of our proposed algorithm has been tested on Mobile Peak Benchmark (MPB), Generalized Dynamic Benchmark Generator (GDBG) and Generalized Moving Peaks Benchmark (GMPB) problems and compared with seven state-of-the-art dynamic optimization algorithms. The experimental results validate the proposed algorithm performed competitively while solving DOPs.

Keywords:

Fast density peak clustering

Particle swarm optimizer

Optimal particle calibration strategy

Dynamic optimization problems

A fast density peak clustering based particle swarm optimizer for dynamic optimization

Abstract

Journal

Organization