混合快速细菌觅食算法求解非线性方程  

Hybrid fast bacterial foraging algorithm for solving nolinear equation

作　　者：郭德龙[1] 郑添健[1] 周永权[2] 

机构地区：[1]黔南民族师范学院数学系,贵州都匀558000 [2]广西民族大学信息与工程学院,南宁530006

出　　处：《计算机工程与应用》2014年第21期32-34,51,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61165015);广西自然科学基金(No.0832082);广西自然科学基金重点项目(No.2012GXNSF-DA053028);贵州省教育厅科研项目(黔教科2010093)

摘　　要：对于非线性方程组的求解,传统方法有很多,如牛顿法、梯度下降法等,但这些算法存在要求方程组连续可微、初值的选取是否合适等缺点,根据以上缺点将求解的问题转化为优化的问题,提出了新的交叉优化算法,充分利用细菌觅食算法局部搜索能力和粒子群算法的全局搜索能力,充分发挥了这两个算法各自优点。数值实验表明,新的算法可以弥补粒子群算法局部搜索能力弱和细菌觅食算法的全局搜索能力的不足,是求解非线性方程的有效方法。Traditional methods for solving nonlinear equations, such as Newton’s method, gradient descent method and so on,but they are required continuous differentiable, initial value selection. Aiming at above faults, the solution of the problem is transformed to an optimization problem. A new crossover foraging algorithm which is made full use of the ability of local search and particle swarm algorithm bacterial search ability, giving full play to the advantages of the two algorithms is proposed. Numerical experiments result shows that the new algorithm can make up for the lack of local search ability of particle swarm optimization algorithm and bacterial foraging algorithm global searching ability. This algorithm is an effec-tive method for solving nonlinear equations.

关 键 词：局部优化 交叉 非线性方程 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]