PSO algorithm with high speed convergence based on particle health
|更新时间:2025-12-10
|
PSO algorithm with high speed convergence based on particle health
CIESC JournalIssue 8, Pages: 2328-2333(2011)
作者机构:
1. 北京化工大学信息科学与技术学院,北京,100029
2. 北京交通大学机械与电子控制工程学院,北京,100044
作者简介:
基金信息:
DOI:
CLC:P301
Online First:05 August 2011,
Published:05 August 2011
稿件说明:
移动端阅览
JIN Qibing, ZHAO Zhenxing, SU Xiaojing, et al. PSO algorithm with high speed convergence based on particle health[J]. CIESC Journal, 2011, (8): 2328-2333.
DOI:
JIN Qibing, ZHAO Zhenxing, SU Xiaojing, et al. PSO algorithm with high speed convergence based on particle health[J]. CIESC Journal, 2011, (8): 2328-2333.DOI:
PSO algorithm with high speed convergence based on particle health
Particle swarm optimization(PSO)which has the general purpose optimization method received much attention in past years.In many studies
PSO has been successful in a variety of optimization problems.But the speed of convergence of standard PSO algorithm on high dimensional search space is unacceptable in practice.The concept of particle health was proposed
and gives an algorithm for particle health calculation in this paper.A new variation of PSO model proposed based on particle health(HPSO) can effectively reduce the probability of local optimum and enhance convergence speed especially for high dimensional search spaces.The proposed were tested by a variety of high-dimensional benchmark functions
and compared with standard PSO algorithm and decreasing inertia weight variation(WPSO). It was found that the application of these modifications resulted in significant gain in speed and efficiency.