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

带自变异算子的粒子群优化算法
引用本文:赵志刚,苏一丹. 带自变异算子的粒子群优化算法[J]. 计算机工程与应用, 2006, 42(13): 45-47
作者姓名:赵志刚  苏一丹
作者单位:上海理工大学管理学院,上海,200093;广西大学计算机与电子信息学院,南宁,530004;广西大学计算机与电子信息学院,南宁,530004
摘    要:针对粒子群优化算法中出现的早熟收敛问题,论文提出了一种带自变异算子的粒子群优化算法。该算法在运行过程中增加了随机变异算子,通过对当前最佳粒子进行随机变异来增强粒子群优化算法跳出局部最优解的能力。对几种典型函数的测试结果表明,新算法的全局搜索能力有了显著提高,并且能够有效避免早熟收敛问题。

关 键 词:粒子群优化算法  变异算子  早熟收敛  全局优化
文章编号:1002-8331-(2006)13-0045-03
收稿时间:2005-12-01
修稿时间:2005-12-01

Particle Swarm Optimization with Mutation Operator
Zhao Zhigang,Su Yidan. Particle Swarm Optimization with Mutation Operator[J]. Computer Engineering and Applications, 2006, 42(13): 45-47
Authors:Zhao Zhigang  Su Yidan
Affiliation:1 School of Management, University of Shanghai for Science and Technology, Shanghai 200093; 2 College of Computer and Electronics Information, Guangxi University, Nanning 530004
Abstract:Aiming at solving the premature convergence problem with which particle swarm optimization algorithm (PSO) is faced,an advanced PSO with mutation operator(PSO-MO) is put forward.The new algorithm includes the mutation operator during the running time which can be useful to improve the ability of PSO in breaking away from the local optimum.The experimental results show that the new algorithm not only has great advantage of convergence property over PSO,but also can avoid the premature convergence problem effectively.
Keywords:PSO  mutation operator  premature convergence  global optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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