| 引入变异算子的粒子群优化算法 |
| |
| 引用本文： | 史海军,王志刚,郭广寒.引入变异算子的粒子群优化算法[J].长春理工大学学报,2007,30(3):81-83,76. |
| |
| 作者姓名： | 史海军 王志刚 郭广寒 |
| |
| 作者单位： | 成都理工大学,信息管理学院,成都,610059;华南理工大学,数学科学学院,广州,510640 |
| |
| 摘 要： | 粒子群优化算法是求解函数优化问题的一种新的进化算法,然而它在求解高维函数时容易陷入局部最优。为了克服这个缺点,文中提出了一种引入变异算子的粒子群优化算法,即每次粒子更新后对种群最优位置随机选取其中一维进行变异操作,以增强算法跳出局部最优的能力。通过对5个基准函数的仿真实验,结果表明了新算法的有效性。
|
| 关 键 词： | 粒子群优化算法 群体智能 变异 |
| 文章编号： | 1672-9870（2007）03-0081-03 |
| 修稿时间： | 2007-02-10 |
Particle Swarm Optimizer with Mutation Operator |
| |
| SHI Haijun,WANG Zhigang,GUO Ganghan.Particle Swarm Optimizer with Mutation Operator[J].Journal of Changchun University of Science and Technology,2007,30(3):81-83,76. |
| |
| Authors: | SHI Haijun WANG Zhigang GUO Ganghan |
| |
| Affiliation: | 1. College of Information Management, Chengdu University of Technology, Chengdu 610059; 2.College of Computer Science and Engineering, South China University of Technology, Guangzhou 510640 |
| |
| Abstract: | Particle swarm optimization is a new computational method for tackling optimization functions.However,it is easily trapped into the local optima when solving high-dimension functions.To overcome this shortcoming,a novel version of particle swarm optimization with mutation operator is proposed,in which one dimension of the current best solution is selected for mutation.Five benchmark functions are tested,and the result indicates that the modified PSO is effective to find the global optimal solution. |
| |
| Keywords: | particle swarm optimization swarm intelligence mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
