Exponential Particle Swarm Optimization for Global Optimization
Khelil Kassoul, Nicolas Zufferey, Naoufel Cheikhrouhou, Samir Brahim Belhouari
University of Geneva HES-SO University of Applied Sciences and Arts Western Switzerland HES-SO Genève Hamad bin Khalifa University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Nature-inspired metaheuristics have been extensively investigated to solve challenging optimization problems. Particle Swarm Optimization (PSO) is one of the most famous nature-inspired algorithms owing to its simplicity and ability to be used in a wide range of applications. This paper presents an extended PSO variant, namely, Exponential Particle Swarm Optimization (ExPSO). To effectively explore the whole search space, the proposed algorithm divides the swarm population into three equal subpopulations and employs a new search strategy based on an exponential function (permitting particles to make leaps in the search space) and an adapted control of the velocity range of each particle (to balance the exploration and exploitation search phases). The leaping strategy is integrated into the velocity equation and a new linear decreasing cognitive parameter (including a dynamic inertia weight strategy) is integrated into the proposed method. The developed algorithm allows large jumps at the beginning of the search, and then small jumps for further improvements in specific regions of the solution search space. Our variant approach, ExPSO, has been intensively tested through a comparison with eight other well-known heuristic search algorithms, over 29 benchmark problems, and real optimization engineering problems. The Wilcoxon signed-rank test and Friedman rank have been applied to analyze the search performance of the algorithms. The comparisons and statistical results show that the exponential search strategy significantly contributes to the search process and proves the superiority of ExPSO in terms of the convergence velocity and optimization accuracy.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIMetaheuristic Optimization Algorithms Research
Distributed Control Multi-Agent Systems · Antenna Design and Optimization