| 双吸引子多群体粒子群算法解决动态优化问题 |
| |
| 引用本文： | 田宇,李斌,王瑜.双吸引子多群体粒子群算法解决动态优化问题[J].系统仿真学报,2010,22(5). |
| |
| 作者姓名： | 田宇 李斌 王瑜 |
| |
| 作者单位： | 中国科学技术大学,电子科学与技术系,合肥,230027 |
| |
| 基金项目： | National Science Foundation (60401015) (60572012); Anhui Science Foundation (050420201) |
| |
| 摘 要： | 提出了一种新的双吸引子多群体粒子群优化算法(BMPSO)。与传统的粒子群优化算法(PSO)相比,BMPSO的主要特点是它使用了两个群体吸引子和两种搜索粒子。两种搜索粒子具有不同范围的搜索特性,一种利于进行全局搜索而另一种利于进行局部搜索。并且通过引入一种新的传递机制,两部分粒子可以更有效地共享搜索信息。实验表明,BMPSO算法在Moving Peaks Benchmark(MPB)测试问题上具有很好的性能表现。
|
| 关 键 词： | 粒子群优化 双群体吸引子 多群体策略 动态优化算法 |
Bi-attractor Multi-population Particle Swarm Algorithm for Dynamic Optimization Problems |
| |
| TIAN Yu,LI Bin,WANG Yu.Bi-attractor Multi-population Particle Swarm Algorithm for Dynamic Optimization Problems[J].Journal of System Simulation,2010,22(5). |
| |
| Authors: | TIAN Yu LI Bin WANG Yu |
| |
| Abstract: | A new Bi-attractor Multi-population Particle Swarm algorithm (BMPSO) was proposed.Compared with traditional particle swarm algorithms (PSO),BMPSO uses two types of search particles and two swarm attractors.The two types of search particles focus on different search scopes:one focuses on local search and the other focuses on global search.Furthermore,by adopting a new transfer mechanism,the two types of particles can share their experienced search information more effectively.Experimental analysis shows that... |
| |
| Keywords: | particle swarm optimization bi-attractor multi-population dynamic optimization algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
