| 一种新形式的微粒群算法 |
| |
| 引用本文： | 袁代林,程世娟,陈虬.一种新形式的微粒群算法[J].计算机工程与应用,2008,44(33):57-59. |
| |
| 作者姓名： | 袁代林 程世娟 陈虬 |
| |
| 作者单位： | 1.西南交通大学 应用力学与工程系，成都 610031 2.西南交通大学 数学系，成都 610031 |
| |
| 摘 要： | 标准微粒群算法在优化多峰、多维的复杂函数时，其效果并不理想，容易早熟收敛。为了改进微粒群算法处理此类问题的性能，提出了一种新的微粒群算法。该算法将标准微粒群算法迭代公式中的群体最优位置用个体最优位置的中心代替，有利于增强群体的多样性，避免早熟收敛，同时保持了迭代公式的简洁形式。3个常用测试函数的数值模拟表明，新的微粒群算法较标准微粒群算法在寻优能力上有明显的提高。
|
| 关 键 词： | 微粒群算法 早熟收敛 函数优化 |
| 收稿时间： | 2007-12-17 |
| 修稿时间： | 2008-3-17
|
New formal Particle Swarm Optimization algorithm |
| |
| YUAN Dai-lin,CHENG Shi-juan,CHEN Qiu.New formal Particle Swarm Optimization algorithm[J].Computer Engineering and Applications,2008,44(33):57-59. |
| |
| Authors: | YUAN Dai-lin CHENG Shi-juan CHEN Qiu |
| |
| Affiliation: | 1.Dept. of Appl. Mechanics and Engineering，Southwest Jiaotong University，Chengdu 610031，China 2.Dept. of Mathematics，Southwest Jiaotong University，Chengdu 610031，China |
| |
| Abstract: | The standard particle swarm optimization algorithm(PSO) shows a bad performance when optimizing the multimodal and higher dimensional functions.A new formal particle swarm optimization(MPSO) is advanced,which replaces the global best place(p)g by the center of all individual best places(pmean).So,the colonial diversity is increased,and the pre-mature convergence is avoided to some degree.At the same time,the concise iterative formulation is kept.The simulations of 3 testing functions show that the MPSO has better ability to find the global optimum solution than the standard particle swarm optimization algorithm. |
| |
| Keywords: | particle swarm optimization pre-mature convergence function optimization |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
