| 动态惯性权重向量和维变异的粒子群优化算法 |
| |
| 引用本文： | 梁昔明,董淑华,龙文,肖晓芳.动态惯性权重向量和维变异的粒子群优化算法[J].计算机工程与应用,2011,47(5):29-31. |
| |
| 作者姓名： | 梁昔明 董淑华 龙文 肖晓芳 |
| |
| 作者单位： | 中南大学,信息科学与工程学院,长沙,410083 |
| |
| 基金项目： | 国家自然科学基金，高校博士点基金项目 |
| |
| 摘 要： | 分析了含维变异算子的粒子群优化算法全局搜索能力与收敛速度的矛盾,提出了动态惯性权重向量和维变异的改进粒子群优化算法。算法首先定义了维多样性的概念,根据维多样性的情况动态地调整惯性权重向量,并对维多样性最差的维进行变异。4个典型测试函数的仿真实验说明该算法具有更强的全局搜索能力和更快的收敛速度。
|
| 关 键 词： | 粒子群优化 维多样性 惯性权重向量 维变异 |
| 修稿时间： | |
PSO algorithm with dynamical inertial weight vector and dimension mutation |
| |
| LIANG Ximing,DONG Shuhua,LONG Wen,XIAO Xiaofang.PSO algorithm with dynamical inertial weight vector and dimension mutation[J].Computer Engineering and Applications,2011,47(5):29-31. |
| |
| Authors: | LIANG Ximing DONG Shuhua LONG Wen XIAO Xiaofang |
| |
| Affiliation: | School of Information Science and Engineering,Central South University,Changsha 410083,China |
| |
| Abstract: | The contradiction of the global exploration and convergence speed of particle swarm optimization with dimension mutation operator is analyzed,and an improved algorithm（WPSO） is proposed by modifying PSO with dimension mutation based on dynamical inertial weight vector.In the proposed algorithm,the concept of dimension diversity is defined and inertial weight vector will be updated dynamically according to dimension diversity.The mutation operates on dimension whose dimension diversity is the worst.The simulation on four typical test functions indicates that the proposed algorithm has more powerful global exploration ability and faster convergence speed. |
| |
| Keywords: | particle swarm optimization dimension diversity inertial weight vector dimension mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
