摘要
标准烟花算法粒子间交流机制存在缺陷,且对最优点位置不在原点和原点附近时的目标函数求解能力差,对此提出差分进化引导趋化算子的烟花算法(BFA)。利用差分进化算法和趋化算子的局部搜索优势,在每一次迭代的过程中不断寻找这一代的最好个体,通过最优个体信息对局部粒子维度信息进行修改从而使得整个群体得到改善,8个标准和增加位置偏移的测试函数仿真结果表明,BFW相比于原始烟花算法(FA),粒子群算法和SPSO在寻优精度和寻优速度上有了较好的提高。
In order to solve the default of the fireworks algorithm inter-particle exchange mechanism and the disadvantage that the optimal position is not solved by the objective function near the origin and the origin come up with fireworks algorithm optimization with chemotaxis operator(BFW).Using the local search advantage of the chemotaxis operator to find the best individual in every iteration to improve the whole population's search ability.The improved algorithm has been tested on 8 benchmark functions.The experimental results show that BFW has better behaviors in convergence accuracy and speed.
作者
刘茜
毛力
杨弘
LIU Xi;MAO Li;YANG Hong(School of Internet of Things Engineering,Jiangnan University,Wuxi,Jiangsu 214122,China;Freshwater Fisheries Research Center of Chinese Academy of Fishery Sciences,Wuxi,Jiangsu 214081,China)
出处
《计算机工程与应用》
CSCD
北大核心
2019年第3期140-146,230,共8页
Computer Engineering and Applications
基金
"十二五"农村领域国家科技计划子课题(No.2015BAD17B02-8)
现代农业产业技术体系专项资金项目(No.CARS-49)
江苏省产学研合作项目(No.BY2015019-30)
关键词
烟花算法
趋化因子
差分进化
函数优化
全局寻优
fireworks algorithm
chemotaxis operator
differential evolution
function optimization
global optimization
