>> 自然科学版期刊 >> 2015年06期 >> 正文
多尺度协同搜索简化粒子群算法与性能分析
供稿: 郑艳玲;王占奎 时间: 2018-11-19 次数:

作者:郑艳玲王占奎

作者单位:河南科技学院机电学院

摘要:针对标准粒子群算法容易早熟的问题,模仿自然界中蚂蚁的不同分工和协作,提出了一种全局搜索和局部精细搜索协同进行的多尺度协同搜索简化粒子群算法(MSPSO),并对算法中粒子的搜索轨迹和算法的收敛性进行了分析和证明。为了验证和比较MSPSO和SPSO算法的性能,采用了VB6.0编程对3个常用的测试函数进行了数值实验,实验表明,该算法具有良好的搜索性能,特别适合于高维函数优化问题。

基金:河南省自然科学基金资助项目(2009A110006);新乡市科技发展计划项目(086058);

关键词:粒子群;多尺度;收敛性;全局搜索;

DOI:10.16186/j.cnki.1673-9787.2015.06.028

分类号:TP18

Abstract:A multi-scale cooperative searching simplified PSO( MSPSO) was put forward to avoid the standard PSO( SPSO) premature,which was put forward by simulating ants working cooperatively in nature. Its particles trajectories were analyzed and its convergence was proved. To test and compare MSPSO and SPSO algorithm performance,VB6. 0 was used to do numerical experiment with three commonly used test function. The numerical experiment indicated that the MSPSO has better searching performance,especially in solving the higher dimensional optimization problems.

最近更新