Particle swarm optimization: A comprehensive survey

TM Shami, AA El-Saleh, M Alswaitti, Q Al-Tashi… - Ieee …, 2022 - ieeexplore.ieee.org
Particle swarm optimization (PSO) is one of the most well-regarded swarm-based algorithms
in the literature. Although the original PSO has shown good optimization performance, it still …

Particle swarm optimization algorithm: an overview

D Wang, D Tan, L Liu - Soft computing, 2018 - Springer
Particle swarm optimization (PSO) is a population-based stochastic optimization algorithm
motivated by intelligent collective behavior of some animals such as flocks of birds or …

The colony predation algorithm

J Tu, H Chen, M Wang, AH Gandomi - Journal of Bionic Engineering, 2021 - Springer
This paper proposes a new stochastic optimizer called the Colony Predation Algorithm
(CPA) based on the corporate predation of animals in nature. CPA utilizes a mathematical …

Co-evolutionary competitive swarm optimizer with three-phase for large-scale complex optimization problem

C Huang, X Zhou, X Ran, Y Liu, W Deng, W Deng - Information Sciences, 2023 - Elsevier
Practical optimization problems often involve a large number of variables, and solving them
in a reasonable amount of time becomes a challenge. Competitive swarm optimizer (CSO) is …

Major advances in particle swarm optimization: theory, analysis, and application

EH Houssein, AG Gad, K Hussain… - Swarm and Evolutionary …, 2021 - Elsevier
Over the ages, nature has constantly been a rich source of inspiration for science, with much
still to discover about and learn from. Swarm Intelligence (SI), a major branch of artificial …

Dispersed foraging slime mould algorithm: Continuous and binary variants for global optimization and wrapper-based feature selection

J Hu, W Gui, AA Heidari, Z Cai, G Liang, H Chen… - Knowledge-Based …, 2022 - Elsevier
The slime mould algorithm (SMA) is a logical swarm-based stochastic optimizer that is easy
to understand and has a strong optimization capability. However, the SMA is not suitable for …

Simulated annealing-based dynamic step shuffled frog lea** algorithm: Optimal performance design and feature selection

Y Liu, AA Heidari, Z Cai, G Liang, H Chen, Z Pan… - Neurocomputing, 2022 - Elsevier
The shuffled frog lea** algorithm is a new optimization algorithm proposed to solve the
combinatorial optimization problem, which effectively combines the memetic algorithm …

Synergizing the enhanced RIME with fuzzy K-nearest neighbor for diagnose of pulmonary hypertension

X Yu, W Qin, X Lin, Z Shan, L Huang, Q Shao… - Computers in Biology …, 2023 - Elsevier
Pulmonary hypertension (PH) is an uncommon yet severe condition characterized by
sustained elevation of blood pressure in the pulmonary arteries. The delaying treatment can …

Position-transitional particle swarm optimization-incorporated latent factor analysis

X Luo, Y Yuan, S Chen, N Zeng… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
High-dimensional and sparse (HiDS) matrices are frequently found in various industrial
applications. A latent factor analysis (LFA) model is commonly adopted to extract useful …

A dynamic neighborhood-based switching particle swarm optimization algorithm

N Zeng, Z Wang, W Liu, H Zhang… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
In this article, a dynamic-neighborhood-based switching PSO (DNSPSO) algorithm is
proposed, where a new velocity updating mechanism is designed to adjust the personal …