Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (16): 77-79.

• 学术探讨 • Previous Articles     Next Articles

Cauchy Particle Swarm optimization based on dynamic probability mutation

LIU Dong1,HAO Ting2,LIU Xi-yu1   

  1. 1.College of Information Science and Engineering,Shandong Normal University,Ji’nan 250014,China
    2.College of Material Science and Engineering,Shandong University,Ji’nan 250061,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-01 Published:2007-06-01
  • Contact: LIU Dong

基于动态概率变异的Cauchy粒子群优化

刘 栋1,郝 婷2,刘希玉1   

  1. 1.山东师范大学 信息科学与工程学院,济南 250014
    2.山东大学 材料科学与工程学院,济南 250061
  • 通讯作者: 刘 栋

Abstract: This paper first introduce Standard Particle Swarm Optimization algorithm,and then Cauchy Particle Swarm Optimization,which is based on two improved particle swarm optimization algorithms:Gaussian Swarm and Fuzzy PSO,is proposed.Moreover,it imports mutation operation of Genetic Algorithm to Particle Swarm Optimization and form dynamic probability mutation Cauchy Particle Swarm Optimization algorithm.Three benchmark function are tested and show that the performance of the DMCPSO Algorithm is better than SPSO and CPSO algorithms.

摘要: 介绍了标准粒子群优化(SPSO)算法,在两种粒子群改进算法Gaussian Swarm和Fuzzy PSO的基础上提出了Cauchy粒子群优化(CPSO)算法,并将遗传算法中的变异操作引入粒子群优化,形成了动态概率变异Cauchy粒子群优化(DMCPSO)算法。用3个基准函数进行实验,结果表明,DMCPSO算法性能优于SPSO和CPSO算法。