首页> 外文会议>2010 Sixth International Conference on Natural Computation >Simplified particle swarm optimization algorithm based on particles classification
【24h】

Simplified particle swarm optimization algorithm based on particles classification

机译:基于粒子分类的简化粒子群优化算法

获取原文

摘要

When basic particle swarm optimization algorithm (PSO) is used to resolve some complex problems, its global optimal model usually falls into local optimal value and its local model has slowest convergence velocity in the later stage of evolution. So, a simplified particle swarm optimization algorithm is proposed. Firstly, all particles in whole swarm are divided into three categories, denoted as the better particles, the ordinary particles and the worse particles according to their fitness. After the velocity equation of PSO is analyzed, the velocity part of PSO's iteration equations is removed rationally. Then, these three types of particles evolve dynamically according to three corresponding kinds of simplified algorithm models. Then, PSO, other two improved PSOs with good optimization performance at present and simplified PSO proposed by this paper all are used to resolve the optimization problems of four widely used test functions, and the results show that simplified PSO has better optimization performance than others.
机译:当使用基本粒子群优化算法(PSO)解决一些复杂的问题时,其全局最优模型通常落入局部最优值,并且其局部模型在演化的后期具有最慢的收敛速度。因此,提出了一种简化的粒子群优化算法。首先,将整个群中的所有粒子按适合度分为三类,分别为较好的粒子,普通的粒子和较差的粒子。在分析了PSO的速度方程后,合理地去除了PSO迭代方程的速度部分。然后,这三种类型的粒子根据三种相应的简化算法模型动态演化。然后,将PSO,目前其他两种具有良好优化性能的改进型PSO以及本文提出的简化PSO全部用于解决四种广泛使用的测试功能的优化问题,结果表明,简化PSO具有比其他更好的优化性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号