作　　者： ; ; ; ;

机构地区： 武汉理工大学

出　　处： 《华中科技大学学报（自然科学版）》 2005年第8期48-50,93,共4页

摘　　要： 提出了一种新型的PSO算法———含速度变异算子的粒子群算法(PSOVMO).该算法在进行变异时的变异对象是搜索速度(v),而不是通常情况下的位置(x).其方法是,设置一个随迭代的进行按指数级数减小的临界速度.在变异开始到整个搜索循环结束之间的每一次迭代中,只要第i个粒子在d维上的搜索速度的绝对值|vi,d|大于此时的临界速度,就以一定的概率重新初始化vi,d:让vi,d随机分布在区间[-vmax,vmax]上,从而通过位置迭代公式将原本聚集的粒子均匀地“驱赶”到前一位置的周围,达到变异的目的.通过对4个多峰测试函数所做的对比实验,表明PSOVMO优于原始的PSO,也优于按传统方法变异的PSO. A new Particle Swarm Optimization （PSO） algorithm PSO with velocity mutation operator（PSOVMO）, was presented, In the algorithm, the searching speed （v） rather than the position （x） was used as the mutation object. A critical velocity was set in every iteration and the value of the critical velocity decreased according to exponential series in every iteration. In every iteration starting from the mutation to the end of the whole searching loop, as long as │vi,d│ the ith particle＇s absolute value of searching velocity on the dimension d, is greater than the critical velocity, the value of vi,d was reset according to some probability, making vi,d distributed stochastically in the range of [ - Vmax, Vmax], through the position updated formula （Xi,d = Xi,d ＋ Vi,d ）, originally converged particles were driven to around the former position, so the mutation was gotten, The contrastive experiments of four multi-peak testing functions Ackley, Schaffer f6, Griewank and Rastrigin, indicated that PSOVMO is greatly superior to original PSO as well as PSO with mutation common methods.

关 键 词： 粒子群优化算法 速度变异 临界速度

领　　域： [自动化与计算机技术] [自动化与计算机技术]