Computer Engineering and Applications ›› 2006, Vol. 42 ›› Issue (9): 23-.

• 博士论坛 • Previous Articles    

A Competitive Particle Swarm Optimization and Its Application to MSA

  

  1. 广东商学院数学与计算科学系,广东 广州 510320
  • Received:2005-11-29 Revised:1900-01-01 Online:2006-03-21 Published:2006-03-21

竞争PSO在多序列联配中的应用

胡桂武   

  1. 广东商学院数学与计算科学系,广东 广州 510320
  • 通讯作者: 胡桂武 pophu998 pophu998

Abstract: In this paper, a competitive PSO is presented for MSA. Based on the best fitness of the particles, inertia weights and the velocity range of the particles are classified and adjusted dynamically with the evolution of particle swarm in the algorithm, which will improve the convergence speed and precision. To avoid the possible prematurity in the PSO, the re-initialization mechanism is introduced in the algorithm. The novel velocity model and the competitive strategy is presented, which increases the power of PSO. Experiment shows the algorithm is effective.

摘要: 本文提出了一种求解多序列联配的竞争粒子群优化算法,算法根据适应值分类设计了粒子群的惯性权重以及其飞行速度范围,并进行了动态调整,提高了算法的收敛速度和精度;引入了重新初始化机制,有效的避免粒子群优化算法可能出现的早熟现象;提出了一种全新的速度更新模式和竞争策略,增强了算法的能力。实验表明该算法是有效的。