1. 江南大学理学院
2. 无锡市生物计算工程技术研究中心
纸质出版:2021
移动端阅览
向蕾, 鲁海燕, 胡士娟, 等. 改进的基于差分进化的群集蜘蛛优化算法[J]. 传感器与微系统, 2021,(6):121-125+132.
XIANG Lei, LU Haiyan, HU Shijuan, et al. Improved SSO algorithm based on differential evolution[J]. 2021, (6): 121-125+132.
向蕾, 鲁海燕, 胡士娟, 等. 改进的基于差分进化的群集蜘蛛优化算法[J]. 传感器与微系统, 2021,(6):121-125+132. DOI: 10.13873/J.1000-9787(2021)06-0121-05.
XIANG Lei, LU Haiyan, HU Shijuan, et al. Improved SSO algorithm based on differential evolution[J]. 2021, (6): 121-125+132. DOI: 10.13873/J.1000-9787(2021)06-0121-05.
为了克服群集蜘蛛优化(SSO)算法易陷入局部极值和收敛速度慢等缺陷
提出了一种融合差分进化和粒子群优化算法搜索机制的改进群集蜘蛛算法。在群集蜘蛛算法中引入差分变异算子
让部分雌蜘蛛进行由种群中全局最优个体和两个随机个体所引导的变异
从而增加种群多样性
提高算法跳出局部最优解的能力。另外
在上述改进的基础上
借鉴粒子群优化算法的搜索机制
在位置更新公式中添加一组动态的非线性惯性权重及学习因子
以更好地平衡算法的局部和全局搜索能力。实验结果表明:改进的群集蜘蛛算法具有更快的收敛速度和更好的求解精度。
In order to overcome the disadvantages of social spider optimization(SSO)algorithm such as easily falling into local optima and slow convergence speed
an improved SSO algorithm integrated with searching mechanisms of differential evolution(DE)and particle swarm optimization(PSO)is proposed.The differential mutation operator of DE is introduced in the social spider optimization algorithm to allow some female spiders to mutate under the guidance of the global optimal individual and two randomly chosen individuals in the population.This mutation strategy can increase the diversity of the population
improve the ability to jump out of local optima
and accelerate the convergence speed of the algorithm.In addition
based on the above improvements and inspired by the searching mechanism of PSO
a set of dynamic nonlinear inertial weights and learning factors are added to the updating equations to get better balance between the local and global search abilities of the algorithm.The experimental results show that the improved social spider optimization algorithm has faster convergence speed and better solution precision.
0
浏览量
274
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621