分段式微粒群优化算法  

Multi-sections Particle Swarm Optimization Algorithm

作　　者：滕居特[1] 陈国初[1] 顾幸生[1] 

机构地区：[1]华东理工大学自动化研究所

出　　处：《华东理工大学学报（自然科学版）》2006年第4期462-465,共4页Journal of East China University of Science and Technology

基　　金：国家自然科学基金项目(60274043);国家高技术研究发展计划项目(2002AA412610)

摘　　要：提出一种分段式微粒群优化算法。该算法将所要搜索的区域分成若干段,首先在每一区段内搜索出区段的最优位置,然后将各区段的最优位置组成一微粒群,继续搜索全局最优位置。通过对5个常用标准测试函数进行优化计算,仿真结果表明:分段式微粒群优化算法能有效地搜索到全局最优解,具有比基本微粒群优化算法更快的搜索速度和更好的优化性能。A multi-sections particle swarm optimization algorithm （MSPSO） is proposed. The new algorithm assumes that the search area is divided into several sections. The best position of each section is found using particle swarm optimization algorithm and a new swarm that consists of the best positions of sections searches for the global best position by particle swarm optimization algorithm again. Then, both MSPSO and PSO are used to resolve five widely used test functions＇ optimization problems. Results show that MSPSO has quicker convergence velocity and better optimization performance than PSO.

关 键 词：分段 微粒群优化算法 优化 仿真 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]