PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 26, 2026Applied Sciences0 citationsOpen Access

State-Adaptive Knowledge Recall Particle Swarm Optimization for Engineering Optimization

View Full Paper
SZShuying ZhangYZYufei ZhangMGMinghan Gao

Key Points

  • The aim is to improve particle swarm optimization (PSO) by preserving and reusing knowledge during optimization processes.
  • Developed the SKRPSO algorithm with three components: an adaptive aggregation mechanism, a stagnation-driven recall mechanism, and a knowledge-fusion strategy.
  • Performed experiments on the CEC2017 benchmark suite with 30 independent runs to assess the algorithm's performance.
  • Evaluated engineering design results for overall stability.
  • SKRPSO achieved the best mean error on 22 of 29 functions in the benchmark suite.
  • It achieved the best overall Friedman average rank of 1.431 among all compared algorithms.
  • Engineering design evaluations indicated consistent and stable performance.

Abstract

Particle swarm optimization (PSO) has been widely used in engineering optimization because of its simple structure and easy implementation. However, standard PSO and most of its variants mainly learn from the personal best position and the global best position. Thus, they often fail to preserve and reuse population-level knowledge generated during the search process. This problem becomes more evident when the search state changes or the swarm falls into stagnation, at which point useful search information may be ignored or forgotten. To address this issue, this paper proposes a state-adaptive knowledge recall PSO algorithm, termed SKRPSO. It includes three cooperative components. First, a state-aware adaptive aggregation mechanism adjusts the elite knowledge-pool size according to population dispersion and builds a rank-weighted knowledge vector for stable population-level guidance. Second, a stagnation-driven knowledge recall mechanism stores historical knowledge associated with global improvements in a bounded memory buffer and recalls recently successful knowledge with a time-decay preference when stagnation is detected. Third, a knowledge-fusion position update strategy uses current aggregated knowledge during normal search and recalled knowledge under stagnation, balancing local exploitation and stagnation escape. Experiments on the CEC2017 benchmark suite show that, based on 30 independent runs, SKRPSO achieves the best mean error on 22 of 29 functions and the best overall Friedman average rank of 1.431 among all compared algorithms. Engineering design results further indicate stable performance.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhang et al. (2026) studied this question.

synapsesocial.com/papers/6a153bdfb5d9c58d83e8d4f0https://doi.org/10.3390/app16115255
Ask AI
Helpful
Bookmark
Share
View Full Paper