系统仿真学报 ›› 2017, Vol. 29 ›› Issue (2): 264-272.doi: 10.16182/j.issn1004731x.joss.201702005

• 仿真建模理论与方法 • 上一篇    下一篇

具有入侵杂草策略的花朵授粉算法

肖辉辉1,2, 段艳明1   

  1. 1.河池学院计算机与信息工程学院,广西 宜州 546300;
    2.江西财经大学信息管理学院,江西 南昌 330013
  • 收稿日期:2015-05-06 修回日期:2015-06-18 出版日期:2017-02-08 发布日期:2020-06-01
  • 通讯作者: 段艳明(1978-),女,江西永新,硕士,副教授,研究方向为智能计算。
  • 作者简介:肖辉辉(1977-),男,江西永新,博士生,副教授,研究方向为智能计算、情感计算。
  • 基金资助:
    国家自然科学基金(61165015, 61562032),河池学院科研项目(XJ2015QN003)

Flower Pollination Algorithm with Invasive Weed Optimization

Xiao Huihui1,2, Duan Yanming1   

  1. 1. College of Computer and Information Engineering, Hechi University, Yizhou 546300, China;
    2. School of Information and Technology, Jiangxi University of Finance and Economics, Nanchang 330013, China
  • Received:2015-05-06 Revised:2015-06-18 Online:2017-02-08 Published:2020-06-01

摘要: 针对花朵授粉算法易陷入局部极值、收敛速度慢的不足,提出一种具有入侵杂草策略的花朵授粉算法。该算法通过入侵杂草的繁殖、空间扩散和竞争策略,动态生成种群,增加种群的多样性和有效性,使算法能有效地避免陷入局部最优,增强全局寻优能力,提高收敛速度。通过8个CEC2005 benchmark测试函数进行测试比较,仿真结果表明,改进算法的全局寻优能力明显优于基本的花朵授粉算法、差分进化算法和蝙蝠算法,其收敛精度、收敛速度、鲁棒性均较对比算法有较大提高。

关键词: 花朵授粉算法, 寻优性能, 入侵杂草算法, 适应度值

Abstract: In order to overcome the problems of easily relapsing into local extremum and low speed of convergence, a flower pollination algorithm with invaded weeds strategy was propsed. The algorithm generate dynamically populations, and creased the diversity and effectiveness of population by breeding, spatial diffusion and competition of invasive weeds. It could effectively avoid local optimum, enhance the capacity of global optimization, and improve the convergence speed. The comparison and analysis results of the 8 CEC2005 benchmark functions, the simulation results show that the proposed algorithm has the advantages of better global searching ability, faster convergence and more precise convergence than those of the basic flower pollination algorithm, differential evolution algorithm and bat algorithm.

Key words: Flower Pollination Algorithm, optimization performance, Invasive Weed Optimization Algorithm, fitness

中图分类号: