一种高速收敛粒子群优化算法

针对粒子群优化算法早熟问题，提出一种克服早熟的高速收敛粒子群算法．该算法首先采用混沌序列初始化粒子位置，以增强搜索多样性；其次，在算法中嵌入有效判断早熟停滞的方法，一旦检索到早熟迹象，便随机地选择最优解任意一维的分量值，用一个随机值取代它，以扰乱粒子的当前搜索轨迹，使其跳出局部最优．大量仿真实验表明，大多数连续函数的寻优过程只需用几个粒子、迭代几十次便能完成，可实现全局寻优过程的高速收敛．

A PSO algorithm with high speed convergence

For the problem that particle swarm optimization (PSO) algorithm often suffers from being trapped in local optima so as to be premature convergence,an improved PSO with high-speed convergence is proposed to efficiently control premature stagnation.Firstly,chaotic sequence is used to initiate individual position,which strengthens the diversity of searching.Furthermore,an effective method that identifies premature stagnation is embedded to PSO,so once premature stagnation happens,a randomized solution,as a su...