Improved Particle Swarm Optimization With Dynamically Changing Inertia Weight
In order to improve the performance of particle swarm (PSO) algorithm which inertia weight was decreased linearly, a novel particle swarm optimization (NPSO) algorithm with dynamically changing inertia weight was presented. In each iteration process, the inertia weight of the improved algorithm was changed dynamically based on the current iteration and the best fitness. The new algorithm was tested with three benchmark functions. The test results indicated that the disadvantages of slow speed on convergence and easy to be trapped in local optimum of the linearly decreasing weight of the PSO could be overcome effectively.
Particle Swarm Optimization Dynamic inertia weight Convergence velocity Premature
Dongyun Wang Ping Zeng Kai Wang Luowei Li
Department of Electronic&Information, Zhongyuan Institute of Technology, Zhengzhou Henan 450007 China
国际会议
武汉
英文
805-808
2010-06-06(万方平台首次上网日期,不代表论文的发表时间)