黄少荣. 基于随机加速系数的粒子群优化算法[J]. 微电子学与计算机, 2010, 27(6): 114-117.
引用本文: 黄少荣. 基于随机加速系数的粒子群优化算法[J]. 微电子学与计算机, 2010, 27(6): 114-117.
HUANG Shao-rong. A New Particle Swarm Optimization with Random Acceleration[J]. Microelectronics & Computer, 2010, 27(6): 114-117.
Citation: HUANG Shao-rong. A New Particle Swarm Optimization with Random Acceleration[J]. Microelectronics & Computer, 2010, 27(6): 114-117.

基于随机加速系数的粒子群优化算法

A New Particle Swarm Optimization with Random Acceleration

  • 摘要: 针对粒子群算法中加速系数的取值问题,对C1C2的各种取值策略做了充分调查分析,得到参数C1C2对算法性能的影响规律,并提出了一种基于随机加速系数的粒子群优化算法.该算法在迭代的每一代中,加速系数取一定范围内随机产生的一组C1C2的组合,通过非对称的、范围更大的C1C2取值来增加算法的多样性,避免了算法早熟.在典型测试函数上进行对比实验,结果验证了新算法在优化性能和稳定性上高于传统粒子群优化算法.

     

    Abstract: Research into setting the values of the acceleration coefficients C1 and C2 in particle swarm optimization (PSO) is one of the most significant areas for performance improvement.On the basis of the investigation of C1 and C2, this paper present the parameters investigation conclusion and proposed a novel PSO which C1 and C2 are generated as a couple of random numbers within a certain range in each iteration process.The experimental results show that the new method performs better than the methods with fixed values of C1 and C2 for most benchmark problems tested.

     

/

返回文章
返回