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

求解非线性方程组的混合粒子群算法
引用本文:欧阳艾嘉,刘利斌,乐光学,李肯立.求解非线性方程组的混合粒子群算法[J].计算机工程与应用,2011,47(9):33-36.
作者姓名:欧阳艾嘉  刘利斌  乐光学  李肯立
作者单位:1. 嘉兴学院,数理与信息工程学院,浙江,嘉兴314001
2. 池州学院,数学与计算机科学系,安徽,池州,247000
3. 嘉兴学院,数理与信息工程学院,浙江,嘉兴314001;湖南大学,计算机与通信学院,长沙,410082
4. 湖南大学,计算机与通信学院,长沙,410082
基金项目:国家自然科学基金重大研究计划,国家自然科学基金
摘    要:结合Hooke-Jeeves和粒子群的优点,提出了一种混合粒子群算法,用于求解非线性方程组,以克服Hooke-Jeeves算法对初始值敏感和粒子群容易陷入局部极值而导致解的精度不够的缺陷。该算法充分发挥了粒子群强大的全局搜索能力和Hooke-Jeeves的局部精细搜索能力,数值实验结果表明:能够以满意的精度求出对未知数具有敏感性的非线性方程组的解,具有良好的鲁棒性和较快的收敛速度和较高的搜索精度。

关 键 词:非线性方程组  Hooke-Jeeves算法  粒子群算法
修稿时间: 

Hybrid particle swarm optimization for solving systems of nonlinear functions
OUYANG Aijia,LIU Libin,YUE Guangxue,LI Kenli.Hybrid particle swarm optimization for solving systems of nonlinear functions[J].Computer Engineering and Applications,2011,47(9):33-36.
Authors:OUYANG Aijia  LIU Libin  YUE Guangxue  LI Kenli
Affiliation:1.College of Mathematics and Information Engineering,Jiaxing University,Jiaxing,Zhejiang 314001,China 2.Department of Mathematics and Computer Science,University of Chizhou,Chizhou,Anhui 247000,China 3.School of Computer and Communication,Hunan University,Changsha 410082,China
Abstract:A Hybrid Particle Swarm Optimization(HPSO) algorithm,which combines the advantages of the method HookeJeeves(HJ) and Particle Swarm Optimization(PSO),is put forward to solve systems of nonlinear functions,and it can be used to overcome the difficulty in selecting good initial guess for HJ and inaccuracy of PSO due to being easily trapped into local optimal.The algorithm has sufficiently displayed the performance of PSO’s global search and HJ’s accurate local search.Numerical computations show that the approach has great robustness,high convergence rate and precision,and it can give satisfactory solutions.
Keywords:systems of nonlinear functions  Hooke-Jeeves  particle swarm optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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