首页 | 官方网站   微博 | 高级检索  
     

基于单纯形法的量子粒子群优化算法
引用本文:任小康,郝瑞芝,孙正兴,史变霞.基于单纯形法的量子粒子群优化算法[J].微电子学与计算机,2010,27(1).
作者姓名:任小康  郝瑞芝  孙正兴  史变霞
作者单位:西北师范大学,数学与信息科学学院,甘肃,兰州,730070
摘    要:针对粒子群优化算法容易陷入局部极值点,进化后期收敛慢和优化精度较差等缺点,提出了将单纯形搜索法与量子粒子群算法混合的改进算法,更好的平衡了全局搜索和局部搜索能力.仿真结果表明,该算法效率高、优化性能好,其性能远远优于一般的粒子群算法与量子粒子群算法.

关 键 词:量子粒子群算法  单纯形法  全局优化

Quantum_ Behaved Particle Swarm Optimization Algorithm Based on Simplex Method
REN Xiao-kang,HAO Rui-zhi,SUN Zheng-xing,SHI Bian-xia.Quantum_ Behaved Particle Swarm Optimization Algorithm Based on Simplex Method[J].Microelectronics & Computer,2010,27(1).
Authors:REN Xiao-kang  HAO Rui-zhi  SUN Zheng-xing  SHI Bian-xia
Abstract:In allusion to particle swarm optimization algorithm (PSO) many defects such as being easy to get into local ex-tremum, slow convergence in the end of evolution stage and low computational precision. A quantum_ behaved particle swarm optimization algorithm (QPSO) with simplex method (SQPSO) is proposed, which can better balance the global searching and local searching ability. The experiment result demonstrated that SQPSO is of high efficiency, and of excel-lent optimum performance, It is of much better performance to PSO and QPSO.
Keywords:QPSO  simplex method  global optimization
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号