计算机与现代化Issue(3)：5-8,14,5.DOI:10.3969/j.issn.1006-2475.2015.03.002
一种改进的粒子群优化算法
A Modified Particle Swarm Optimization Algorithm
摘要
Abstract
In order to overcome the disadvantages of particle swarm optimization algorithm such as premature, bad searching ca-pability, a Modified Particle Swarm Optimization ( MPSO) algorithm was proposed. In this algorithm, when particles fall into the local extreme area, the particles, which gathered at the global optimal particle of the swarm, would have a mutation. Then test re-sults of six complex benchmark functions and computer color matching model indicate that MPSO is superior to other two classic PSOs, which has high convergence precision, fast convergence speed and prevents particle premature effectively.关键词
粒子群优化/惯性权重/全局搜索/早熟/变异Key words
particle swarm optimization/inertia weight/global exploration/premature/mutation分类
信息技术与安全科学引用本文复制引用
徐生兵,夏文杰,冯继强..一种改进的粒子群优化算法[J].计算机与现代化,2015,(3):5-8,14,5.基金项目
国家自然科学基金资助项目(61401283) （61401283）
高等学校博士学科点专项科研基金资助项目(20134408110001) （20134408110001）
深圳大学科研基金资助面上项目(201214) （201214）
东莞理工学院城市学院青年发展基金资助项目(201313) （201313）
