一种催化粒子群算法及其性能分析

Catlytic particle swarm optimization and its performance analysis

针对粒子群算法(PSO)在解决高维、多模复杂问题时容易陷入局部最优的问题,提出了一种新颖的混合算法—催化粒子群算法(CPSO)。在CPSO优化过程中,种群中的粒子始终保持其个体历史最优值pbests。CPSO种群更新由改造PSO、横向交叉以及垂直交叉三个搜索算子交替进行,其中,每个算子产生的中庸解均通过贪婪思想产生占优解pbests,并作为下一个算子的父代种群。在CPSO中,纵横交叉算法(CSO)作为PSO的加速催化剂,一方面通过横向交叉改善PSO的全局收敛性能,另一方面通过纵向交叉维持种群的多样性。对六个典型benchmark函数的仿真结果表明,相比其他主流PSO变体,CPSO在全局收敛能力和收敛速率方面具有明显优势。

To address the problems that the particle swarm optimization （PS0） algorithm is likely to be trapped into the local optima when solving the high-dimensional and multimodal optimization problems, this paper proposed a novel hybrid optimiza- tion algorithm called catalytic particle swarm optimization （CPSO）. In the optimization process of CPSO, pbests represented each particle in the population, directly. And modified PSO, horizontal crossover and vertical crossover updated the population of particles in CPSO, ahematively. Each operator reproduces the moderation solutions, and the moderation solutions would generate the dominant solution pbests through greed thoughts, then the pbests would act as the father population of next opera- tor. As an evolutionary catalytic of PSO, on one hand, CSO enhanced the global search ability of PSO by horizontal crossover, and on the other, maintaining the diversity through vertical crossover. Simulation results for six benchmark functions show that the proposed algorithm demanstrates obvious advantage over other state-of-art PSO variants in terms of global convergence ca- pacity and convergence rate.