首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于邻域极值数的协同粒子群优化算法
引用本文:曾毅,朱旭生,廖国勇.基于邻域极值数的协同粒子群优化算法[J].华东交通大学学报,2014(4):71-76.
作者姓名:曾毅  朱旭生  廖国勇
作者单位:华东交通大学理学院,江西南昌330013
基金项目:国家自然科学基金项目(11161021); 华东交通大学校立科研项目(09111114)
摘    要:提出了一种基于邻域极值数的协同粒子群优化算法。该算法将种群分为若干个独立进化的子种群。根据邻域极值数确定各子种群的生存状态。根据子种群的生存状态对子种群实施相应的控制操作,提高子种群的搜索能力,实现子种群之间的信息共享,共同进化。测试结果表明基于邻域极值数的协同粒子群优化算法是一种高效稳健的全局优化算法。

关 键 词:粒子群优化算法  协同进化  邻域极值数

Cooperative Particle Swarm Optimization Based on Neighborhood Extremum Number
Zeng Yi,Zhu Xusheng,Liao Guoyong.Cooperative Particle Swarm Optimization Based on Neighborhood Extremum Number[J].Journal of East China Jiaotong University,2014(4):71-76.
Authors:Zeng Yi  Zhu Xusheng  Liao Guoyong
Institution:(School of Basic Sciences, East China Jiaotong University, Nanchang 330013, China)
Abstract:A cooperative particle swarm optimization based on the neighborhood extremum number is proposed. In this algorithm, the whole population is divided into several sub-populations evolving independently. The survival state of each sub-population is determined in terms of the neighborhood extremum number. Based on the survival state of each sub-population, corresponding control operation is implemented so as to improve the search ability of each sub-population and realize information sharing so that the sub-populations coevolve. The experimental results show that the cooperative particle swarm optimization based on the neighborhood extremum number is an effective and steady global optimization algorithm.
Keywords:PSO  cooperative coevolution  the neighborhood extremum number
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号