EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

DCWPSO: particle swarm optimization with dynamic inertia weight updating and enhanced learning strategies

Yibo Han, Meiting Lin, Ni Li, Qi Qi iD, Jinqing Li, Qingxin Liu

PeerJ Computer Science · 03.09.2024 · 10 · e2253

DOI: 10.7717/peerj-cs.2253 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 03.09.2024. Verfasst von Yibo Han und 5 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science and Technology, Hainan University, Haikou, China. Die Arbeit wurde bisher 33-mal zitiert (Crossref) und nennt 53 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Education Department of Hainan Province, National Natural Science Foundation of China, Hainan Provincial Natural Science Foundation of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Particle swarm optimization (PSO) stands as a prominent and robust meta-heuristic algorithm within swarm intelligence (SI). It originated in 1995 by simulating the foraging behavior of bird flocks. In recent years, numerous PSO variants have been proposed to address various optimization applications. However, the overall performance of these variants has not been deemed satisfactory. This article introduces a novel PSO variant, presenting three key contributions: First, a novel dynamic oscillation inertia weight is introduced to strike a balance between exploration and exploitation; Second, the utilization of cosine similarity and dynamic neighborhood strategy enhances both the quality of solution and the diversity of particle populations; Third, a unique worst-best example learning strategy is proposed to enhance the quality of the least favorable solution and consequently improving the overall population. The algorithm’s validation is conducted using a test suite comprised of benchmarks from the CEC2014 and CEC2022 test suites on real-parameter single-objective optimization. The experimental results demonstrate the competitiveness of our algorithm against recently proposed state-of-the-art PSO variants and well-known algorithms.

Schlagwörter

Stichwörter der Autor:innen

Cosine similarityDynamic neighborhood strategyInertia weightParticle swarm optimizationSingle-objective optimization

Autor:innen und Institutionen

  • School of Computer Science and Technology, Hainan University, Haikou, China.
  • School of Mathematics and Statistics, Hainan Normal University, Haikou, China.
  • Key Laboratory of Data Science and Smart Education of Ministry of Education, Hainan Normal University, Haikou, China.

ORCID-Profile: Qi Qi

Förderung

  • Education Department of Hainan Province
  • National Natural Science Foundation of China
  • Hainan Provincial Natural Science Foundation of China

Zitieren

APA

Han, Y., Lin, M., Li, N., Qi, Q., Li, J., & Liu, Q. (2024). DCWPSO: particle swarm optimization with dynamic inertia weight updating and enhanced learning strategies. PeerJ Computer Science, 10, e2253. https://doi.org/10.7717/peerj-cs.2253

Vancouver

Han Y, Lin M, Li N, Qi Q, Li J, Liu Q. DCWPSO: particle swarm optimization with dynamic inertia weight updating and enhanced learning strategies. PeerJ Computer Science. 2024;10:e2253. doi:10.7717/peerj-cs.2253

BibTeX
@article{Han2024,
  author = {Han, Yibo and Lin, Meiting and Li, Ni and Qi, Qi and Li, Jinqing and Liu, Qingxin},
  title = {DCWPSO: particle swarm optimization with dynamic inertia weight updating and enhanced learning strategies},
  journal = {PeerJ Computer Science},
  year = {2024},
  volume = {10},
  pages = {e2253},
  doi = {10.7717/peerj-cs.2253}
}
Kostenlos starten →