%0 Journal Article
%T Modified particle swarm optimization algorithm<br>一种改进的微粒群算法*
%A WANG Xu-peng
%A HU Jin-song
%A <br>王胥鹏
%A 胡劲松
%J 计算机应用研究
%D 2009
%I 
%X To deal with the problem of premature convergence and slow search speed,this paper proposed a new particle swarm optimization(PSO).The new method was based on clearing of mines,which was guaranteed to converge to the global optimization solution with probability one.In addition,combined the new method with rotating direction method,which was beneficial for the convergence speed. Through the calculation of three typical function, and made comparison with other improvement particle swarm optimization algorithm, they show that the new method which solves the problem of premature convergence and slow search speed.
%K 微粒群优化算法
%K 排雷策略
%K 旋转方向法
%K 收敛
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=D8FCC47252B36B7956FC035B1EFB9763&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=F3090AE9B60B7ED1&sid=1A9EC401B3D77C81&eid=35730AEE23B1BB43&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=15