基于模拟退火机制的自适应粘性粒子群算法
DOI:
作者:
作者单位:

青岛大学自动化学院

作者简介:

通讯作者:

中图分类号:

TP301

基金项目:

国家自然科学基金(61673228,62072260);青岛市科技计划(21-1-2-16-zhz)


Adaptive Stickiness Particle Swarm Optimization Algorithm Based on Simulated Annealing Mechanism
Author:
Affiliation:

College of Automation, Qingdao University

Fund Project:

National Natural Science Foundation of China (61673228, 62072260); Qingdao Science and Technology Program (21-1-2-16-zhz)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为了进一步提升粒子群算法在离散优化问题中的性能,针对粘性二进制粒子群算法缺乏全局搜索能力、容易陷入局部最优和收敛速度慢的缺点,提出了一种新的自适应参数策略和粒子散度指标,并结合模拟退火机制来改善该算法的寻优能力.为了检验算法性能,通过选取不同维数的背包问题算例库以及不同规模的UCI特征选择问题算例库进行仿真实验,并对实验数据进行统计分析,实验以及分析结果表明新算法在寻优精度、算法稳定性和收敛速度上均优于对比算法.

    Abstract:

    In order to further improve the performance of particle swarm optimization in discrete optimization problems, aiming at the shortcomings of stickiness binary particle swarm optimization, such as lack of global search ability, easy to fall into local optimum and slow convergence speed, a new adaptive parameter strategy and particle divergence index are proposed, and combined with simulated annealing mechanism to improve the optimization ability of the algorithm. In order to test the performance of the new algorithm, simulation experiments are carried out by selecting the knapsack problem case library with different dimensions and the UCI feature selection problem case library with different scales, and the experimental data are statistically analyzed. The experimental and analytical results show that the new algorithm is superior to the comparison algorithm in optimization accuracy, algorithm stability and convergence speed.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2022-02-24
  • 最后修改日期:2022-04-19
  • 录用日期:2022-04-27
  • 在线发布日期:
  • 出版日期: