基于单纯形法和自适应步长的花朵授粉算法

计算机工程与科学

基于单纯形法和自适应步长的花朵授粉算法

肖辉辉

（1.河池学院计算机与信息工程学院,广西宜州 546300;2.江西财经大学信息管理学院,江西南昌 330013）

收稿日期:2015-09-06 修回日期:2015-11-06 出版日期:2016-10-25 发布日期:2016-10-25
基金资助:
国家自然科学基金(61173146);广西高校科研项目(KY2015LX332,KY2015LX334);校级项目(XJ2015QN003);河池学院“计算机网络与软件新技术”重点实验室(院科研【2013】3号);江西省研究生创新项目(YC2015-B054)

A flower pollination algorithm based on

simplex method and self-adaptive step

XIAO Hui-hui

（1.College of Computer and Information Engineering,Hechi University,Yizhou 546300,China;

2.School of Information Management,Jiangxi University of Finance and Economics,Nanchang 330013,China）

Received:2015-09-06 Revised:2015-11-06 Online:2016-10-25 Published:2016-10-25

摘要/Abstract

摘要：

针对花朵授粉算法易陷入局部极值、后期收敛速度慢的不足，提出一种基于单纯形法和自适应步长的花朵授粉算法。该算法在基本花朵授粉算法的全局寻优部分采用自适应步长策略来更新个体位置，步长随迭代次数的增加而自适应地调整，避免局部极值；在局部寻优部分对进入下一次迭代的部分较差个体采用单纯形法的扩张、收缩/压缩操作，提高局部搜索能力，进而提高算法的寻优能力。通过八个CEC2005 benchmark测试函数进行测试比较，结果表明，改进算法的寻优性能明显优于基本的花朵授粉算法，且其收敛速度、收敛精度、鲁棒性均较对比算法有较大提高。

关键词: 花朵授粉算法, 寻优性能, 单纯形法, 自适应步长, 适应度值

Abstract:

Aiming at the problems of easy falling into local extremum and low convergence speed,we propose a self-adaptive step flower pollination algorithm (FPA) based on the simplex method.We use the adaptive step length strategy to update individual location in the global optimization of the FPA,and the step is decreased dynamically along with the increase of iteration so that it can effectively avoid local optimum.In the process of local optimization of the FPA,to enhance the capacity of global optimization and improve the convergence speed,we perform expansion and contraction/compression operation of the simplex method on the weak individuals that enter the next iteration.The comparison and analysis of simulation results on the 8 CEC2005 benchmark functions show that the proposed algorithm has better global searching ability and robustness,and faster and more precise convergence than those of the basic flower pollination algorithms.

Key words: flower pollination algorithm, optimization ability, simplex method, self-adaptive step, fitness

肖辉辉. 基于单纯形法和自适应步长的花朵授粉算法[J]. 计算机工程与科学.

XIAO Hui-hui.

A flower pollination algorithm based on

simplex method and self-adaptive step

[J]. Computer Engineering & Science.

参考文献

［1］Yang X S.Flower pollination algorithm for global optimization［C］∥Proc of Unconventional Computation and Natural Computation,2012:240-249.

［2］Yang X S,Karamanoglu M,He X .Multi-objective flower algorithm for optimization［J］.Procedia Computer Science,2013,18(1):861-868.

［3］El-henawy I,Ismail M.An improved chaotic flower pollination algorithm for solving large integer programming problems［J］.International Journal of Digital Content Technology & its Applications,2014,8(3):71-81.

［4］Marwa S,Emary E,Imane A S,et al.Flower pollination optimization algorithm for wireless sensor network lifetime global optimization［J］.International Journal of Soft Computing and Engineering (IJSCE),2014,4(3):54-59.

［5］Abdel-Raouf O, Ibrahim E H, Mohamed A B. A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles［J］.International Journal of Modern Education and Computer Science,2014,7(3):38-44.

［6］Prathiba R,Moses M B,Sakthivel S.Flower pollination algorithm applied for different economic load dispatch problems［J］.International Journal of Engineering and Technology (IJET),2014,6(2):1009-1016.

［7］Wang Rui,Zhou Yong-quan.Flower pollination algorithm with dimension by dimension improvement［J］.Mathematical Problems in Engineering,2014(4):1-9.

［8］Abdel-Raouf O,Abdel-baset M,El-henawy I.A new hybrid flower pollination algorithm for solving constrained global optimization problems［J］.International Journal of Applied Operational Research,2014,4(2):1-13.

［9］Wang Feng-he,Xun Xi-lian,Chen Qiang,et al.Beijing bees pollinated th crops and work progress［J］.Apiculture of China,2012,63(9):28-30.(in Chinese)

［10］Amer D.On the perfomances of the flower pollination algorithm-qualitative and quantitative analyses［J/OL］［2015-05-15］.Applied Soft Computing,2015,34(c):349-371.http:∥dx.doi.org/10.1016/ j.asoc.2015.05.015.

［11］Nelder J A,Mead R.A simplex method for function minimization［J］.Computer Journal，1965,7(4):308-313.

［12］Wang Lian-guo,Hong Yi,Zhao Fu-qing,et al.Simplified artificial fish swarm algorithm［J］.Journal of Chinese Computer Systems,2009,30(8):1663-1667.(in Chinese)

［13］Zhao Xin-chao,Liu Guo-li,Liu Hu-qiu,et al.Particle swarm optomization algorithm based on non-uniform mutation and multiple stages perturbation［J］.Chinese Journal of Computers,2014,37(9):2058-2070.(in Chinese)

［14］Liu Ting,Wang Lian-guo.Invasive weed optimization algorithm based on clound model［J］.Computer Engineering,2014,40(12):156-160.(in Chinese)

［15］Qiao Jun-fei,Fu Si-peng,Han Hong-gui.A modified differential evolution algorithm based on hybrid mutation strategy for function optimization［J］.Control Engineering of China,2013,20(5):943-947.(in Chinese)

［16］Wang Zhi-gang.Artificial bee colony algorithm with modified search strategy［J］.Computer Simulation,2014,31(10):291-295.(in Chinese)

［17］Li Jing-yang,Wang Yong,Li Chun-lei.Adjustive fishing strategy optimization algorithm［J］.Computer Engineering & Science,2014,36(5):923-928.(in Chinese)

［18］Wang Lei,Zhang Han-peng.Krill herd foraging algorithm based on chaotic searching and elitism crossover operator［J］.Computer Engineering,2015,41(3):156-161.(in Chinese)

附中文参考文献：

［9］王凤鹤,徐希莲,陈强,等.北京蜜蜂授粉工作研究进展［J］.中国峰业,2012,63(9):28-30.

［12］王联国,洪毅,赵付青,等.一种简化的人工鱼群算法［J］.小型微型计算机系统,2009,30(8):1663-1667.

［13］赵新超,刘国莅,刘虎球,等.基于非均匀变异和多阶段扰动的粒子群优化算法［J］.计算机学报,2014,37(9):2058-2070.

［14］刘挺,王联国.基于云模型的入侵杂草优化算法［J］.计算机工程,2014,40(12):156-160.

［15］乔俊飞,傅嗣鹏,韩红桂.基于混合变异策略的改进差分进化算法及函数优化［J］.控制工程,2013,20(5):943-947.

［16］王志刚.一种改进搜索策略的人工蜂群算法［J］.计算机仿真,2014,31(10):291-295.

［17］李景洋,王勇,李春雷.自调整的捕鱼策略优化算法［J］.计算机工程与科学,2014,36(5):923-928.

［18］王磊,张汉鹏.基于混沌搜索与精英交叉算子的磷虾觅食算法［J］.计算机工程，2015,41(3):156-161.

[1]	刘成汉, 何庆. 改进搜索机制的单纯形法引导麻雀搜索算法[J]. 计算机工程与科学, 2022, 44(12): 2238-2245.
[2]	赵志刚,林玉娇,尹兆远. 基于自适应惯性权重的均值粒子群优化算法[J]. J4, 2016, 38(03): 501-506.
[3]	赵同昇[1] 朱文兴[2]. MAX—SAT问题一种改进的局部搜索算法[J]. J4, 2008, 30(11): 50-52.
[4]	夏桂梅曾建潮. 一种基于单纯形法的随机微粒群算法[J]. J4, 2007, 29(1): 90-93.