A hybrid differential evolution particle swarm optimization algorithm based on dynamic strategies
Abstract Particle Swarm Optimization (PSO), a meta-heuristic algorithm inspired by swarm intelligence, is widely applied to various optimization problems due to its simplicity, ease of implementation, and fast convergence. However, PSO frequently converges prematurely to local optima when addressing...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-02-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-024-82648-5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract Particle Swarm Optimization (PSO), a meta-heuristic algorithm inspired by swarm intelligence, is widely applied to various optimization problems due to its simplicity, ease of implementation, and fast convergence. However, PSO frequently converges prematurely to local optima when addressing single-objective numerical optimization problems due to its inherent rapid convergence. To address this issue, we propose a hybrid differential evolution (DE) particle swarm optimization algorithm based on dynamic strategies (MDE-DPSO). In our proposed algorithm, we first introduce a novel dynamic inertia weight method along with adaptive acceleration coefficients to dynamically adjust the particles’ search range. Secondly, we propose a dynamic velocity update strategy that integrates the center nearest particle and a perturbation term. Finally, the mutation crossover operator of DE is applied to PSO, selecting the appropriate mutation strategy based on particle improvement, which generates a mutant vector. This vector is then combined with the current particle’s best position through crossover, aiding particles in escaping local optima. To validate the efficacy of MDE-DPSO, we evaluated it on the CEC2013, CEC2014, CEC2017, and CEC2022 benchmark suites, comparing its performance against fifteen algorithms. The experimental results indicate that our proposed algorithm demonstrates significant competitiveness. |
|---|---|
| ISSN: | 2045-2322 |