arrow
返回

A fast-flying particle swarm optimization for resolving constrained optimization and feature selection problems

delete2024-11-26
delete0
PRE
AI
A
Ajit Kumar Mahapatra
N
Nibedan Panda
M
Madhumita Mahapatra
T
Tarakanta Jena
A
Arup Kumar Mohanty *
DOI:10.1007/s10586-024-04750-7delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Particle Swarm Optimization (PSO) is popular because of its ease of use and few parameter tunings. Also, updating particle velocity using the global and particles' personal best positions as guides is appealing. However, such an update process can cause Oscillation and Two-step forward, One-step backward phenomena, negatively affecting PSO's performance during optimization. Concurrently, it lacks adequate exploitation and exploration-exploitation balance skills, causing premature convergence. Hence, we propose a new hybrid PSO named Fast-flying PSO (FF-PSO) to address PSO's issues. FF-PSO engages only one guide produced by a quantization technique to update velocity, significantly lessening PSO phenomena's adverse impact and enhancing exploitation. Subsequently, it uses a dynamic adaptation of the search dimension strategy to update particle positions. Consequently, refined convergence and solution quality are achieved with better local optima avoidance ability. FF-PSO's efficacy was assessed over 16 basic and Congress of Evolutionary Computation (CEC)-2017 competition's benchmark functions relating to some of the latest algorithms. Next, the practicability of FF-PSO is verified by tackling CEC-2011's constrained optimization and feature selection issues. An inspection of the results of distinct algorithms, including statistical analysis, shows that FF-PSO is securing the top spot among the contenders in over 60% of the problems from each category with some percentage of ties. Thus, FF-PSO may be a more fruitful technique in constrained and possibly other global optimization and feature selection tasks with intensified exploitation and refined convergence.
Keyword:
Particle swarm optimization
Optimal feature selection
Constrained optimization
Search-dimension-ratio
Adaptation of the search dimension
Fast-flying particle swarm optimization

期刊

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
论文数:
5.1K
被引数:
7.5K

机构

G
gandhi institute for technological advancement
学者数:
40
论文数: 33
被引数: 0
引用论文

引用论文

A novel hybrid arithmetic optimization algorithm for solving constrained optimization problems一种求解约束优化问题的混合算术优化算法
err2023-07-01
err60
PREAI
errYildiz, Betul Sultan; Kumar, Sumit; Panagant, Natee; Mehta, Pranav; Sait, Sadiq M.; Yildiz, Ali Riza; Pholdee, Nantiwat; Bureerat, Sujin; Mirjalili, Seyedali
err分享
err收藏
Modeling of Selforganizing Systems
err1997-01-31
err0
PREAI
errCordula Rauwolf; Thomas Stra�ner
err分享
err收藏
err分享
err收藏
Particle Swarm Optimization: A Comprehensive Survey
err2022-01-01
err545
errOAAI
errShami, Tareq M.; El-Saleh, Ayman A.; Alswaitti, Mohammed; Al-Tashi, Qasem; Summakieh, Mhd Amen; Mirjalili, Seyedali
err分享
err收藏
A Statistical Variable Selection Solution for RFM Ill-Posedness and Overparameterization Problems
err2018-07-01
err14
PREAI
errMoghaddam, Sayyed Hamed Alizadeh; Mokhtarzade, Mehdi; Naeini, Amin Alizadeh; Amiri-Simkooei, AliReza
err分享
err收藏
学者 查看更多内容