混合花粉算法求解全局优化问题

doi:10.3969/j.issn.1006-2475.2019.10.010

计算机与现代化

混合花粉算法求解全局优化问题

（华南师范大学计算机学院，广东广州510631）

收稿日期:2019-03-21 出版日期:2019-10-28 发布日期:2019-10-29
作者简介:朱洋洋(1992-),男,江苏淮安人,硕士研究生,研究方向:启发式算法与人工智能，E-mail: yyzhu@m.scnu.edu.cn。
基金资助:
国家自然科学基金面上项目（61373158）

Hybrid Flower Pollination Algorithm For Solving Global Optimization Problems

（School of Computer Science, South China Normal University, Guangzhou 510631, China）

Received:2019-03-21 Online:2019-10-28 Published:2019-10-29

摘要/Abstract

摘要： 元启发式算法可以用作寻找近似最优解的有效工具，因此，对元启发式算法进行改进，提高算法性能是有必要的。本文介绍花粉算法(Flower Pollination Algorithm, FPA)的增强变体，将花粉算法与极值优化算法(Extremal Optimization, EO)混合形成FPA-EO算法。FPA-EO算法综合利用了FPA的全局搜索能力和EO的局部搜索能力，并将其应用于11个基准测试函数来测试新算法。同时将该算法与其他4种著名优化算法（标准花粉算法(FPA)、蝙蝠算法(BAT)、萤火虫算法(FA)、模拟退火算法(SA)）进行比较。综合结果表明，本文算法能够找到比其他4种算法更精确的解。

关键词: 元启发式算法, 极值优化算法, 增强变体, 混合算法

Abstract: Metaheuristic algorithms can be used as an effective tool for finding near-optimal solutions. Therefore, it is necessary to improve metaheuristic algorithms and enhance the algorithm’s performance. This paper introduces an enhanced variant of Flower Pollination Algorithm (FPA)，which combines FPA with Extremal Optimization(EO) to form the FPA-EO. The FPA-EO algorithm makes use of the global search capability of FPA and the local search capability of EO, and applies it to 11 benchmark functions to test the new algorithm. At the same time, the algorithm is compared with other four famous optimization algorithms: standard flower pollination algorithm (FPA), bat algorithm (BAT), firefly algorithm (FA), and simulated annealing algorithm(SA). The comprehensive results show that the algorithm can find a more accurate solution than the other four algorithms.

Key words: metaheuristic algorithms, extremal optimization algorithm, enhanced variant, hybrid algorithm

中图分类号:

TP301

朱洋洋. 混合花粉算法求解全局优化问题[J]. 计算机与现代化, doi: 10.3969/j.issn.1006-2475.2019.10.010.

ZHU Yang-yang. Hybrid Flower Pollination Algorithm For Solving Global Optimization Problems[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2019.10.010.

参考文献

［1］ GHEAMI M, FEIZI-DERAKHSHI M R. Forest optimization algorithm［J］. Expert Systems with Applications, 2014,41(15):6676-6687.
［2］朱博. 人工蜂群算法的改进研究［D］. 昆明:云南财经大学, 2018.
［3］张静. 基于禁忌搜索的TSPR启发式算法求解P-center问题［D］. 武汉:华中科技大学, 2016.
［4］李永恒. 基于改进蝙蝠算法的前向神经网络研究［D］. 南宁:广西大学, 2018.
［5］段少楠，戴胜华. 离散萤火虫算法在高速列车运行调整中的应用［J］. 计算机工程与应用， 2018，54(15):209-213.
［6］杨丹. 改进的花粉算法及其应用［D］. 西安：长安大学, 2017.
［7］李静. 差分进化算法与引力搜索算法的改进［D］. 西安:陕西师范大学, 2018.
［8］ BOETTCHER S, PERCUS A G. Extremal optimization: Methods derived from co-evolution［C］// Proceedings of the Genetic and Evolutionary Computation Conference. 1999:825-832.
［9］ BOETTCHER S, PERCUS A G. Nature’s way of optimizing［J］. Articial Intelligence, 2000,119(1-2):275-286.
［10］BAK P, SNEPPEN K. Punctuated equilibrium and criticality in a simple model of evolution［J］. Physical Review Letters, 1993,71(24):4083-4086.
［11］BAK P, TANG C, WIESENFELD K. Self-organized criticality［J］. Physical Review Letters, 1987,59(4):381-384.
［12］李洋州,顾磊．一种基于曲线自适应和模拟退火的蝗虫优化算法［J/OL］．计算机应用研究, 2018. ［2019-03-01］. https://doi.org/10.19734/j.issn.1001-3695.2018.07.0580.
［13］BOETTCHER S, PERCUS A G. Extremal optimization at the phase transition of the 3-coloring problem［J］. Physical Review E, 2004,69:066703.
［14］LU Y Z, CHEN M R, CHEN Y W. Studies on extremal optimization and its applications in solving real world optimization problems［C］// Proceedings of 2007 IEEE Symposium on Foundations of Computational Intelligence. 2007:162-168.
［15］CHEN Y W, LU Y Z, YANG G K. Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling［J］. International Journal of Advanced Manufacturing Technology, 2008,36(9-10):959-968.
［16］CHEN Y W, LU Y Z, YANG C. Optimization with extremal dynamics for the traveling salesman problem［J］. Physica A: Statistical Mechanics and Its Applications, 2007,385(1):115-123.
［17］CHEN M R, LU Y Z, YANG G K. Multiobjective extremal optimization with applications to engineering design［J］. Journal of Zhejiang University(SCIENCE A), 2007,8(12):1905-1911.
［18］CHEN M R, LU Y Z, YANG G K. Multiobjective optimization using population-based extremal optimization［J］. Neural Computing and Applications, 2008,17(2):101-109.
［19］MOSER I, HENDTLASS T. Solving problems with hidden dynamics-comparison of extremal optimization and ant colony system［C］// Proceedings of 2006 IEEE Congress on Evolutionary Computation. 2006:1248-1255.
［20］CHEN M R, LU Y Z, YANG G K. Population-based extremal optimization with adaptive Levy mutation for constrained optimization［C］// Proceedings of 2006 International Conference on Computational Intelligence and Security. 2006:144-155.
［21］GLOVER B. Understanding Flowers and Flowering［M］. 2nd ed. Oxford University Press, 2014.
［22］CHITTKA L, THOMSON J D, WASER N M. Flower constancy, insect psychology, and plant evolution［J］. Naturwissenschaften, 1999,86(8):361-377.
［23］PAVLYUKEVICH I. Lévy ights, non-local search and simulated annealing［J］. Journal of Computational Physics, 2007,226:1830-1844.
［24］BOETTCHER S, PERCUS A G. Optimization with extremal dynamics［J］. Complexity, 2000,8(2):57-62.
［25］CHEN M R, LI X, ZHANG X, et al. A novel particle swarm optimizer hybridized with extremal optimization［J］. Applied Soft Computing, 2010,10(2); 367-373.
［26］CHEN M R, LU Y Z. A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization［J］. European Journal of Operational Research, 2008,188(3):637-651.
［27］YAO X, LIU Y, LIN G M. Evolutionary programming made faster［J］. IEEE Transactions on Evolutionary Computation, 1999,3(2):82-102.
［28］DERRAC J, GARCA S, MOLINA D, et al. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms［J］. Swarm and Evolutionary Computation, 2011,1(1):3-18.

[1]	赵然1,2，郭志川1,2,朱小勇1,2. 一种基于Levy飞行的改进蝗虫优化算法[J]. 计算机与现代化, 2020, 0(01): 104-.
[2]	时培燕，缑林峰，郭江维，胥韦巍. 基于GA-SQP的航空发动机加速寻优控制[J]. 计算机与现代化, 2014, 0(1): 62-66.
[3]	罗芳琼. 基于混合优化的RBF神经网络模型研究[J]. 计算机与现代化, 2013, 1(7): 51-055.
[4]	张利民;石成英;王游. 金属裂纹图像锐化混合算法研究[J]. 计算机与现代化, 2013, 1(3): 172-174.
[5]	潘学 . 求解非线性方程组的蛙跳和BFGS混合算法[J]. 计算机与现代化, 2013, 12(12): 9-13.
[6]	李艳芳;蒋秀凤. 基于离散粒子群和禁忌搜索的网格资源调度算法[J]. 计算机与现代化, 2011, 193(9): 26-29.

混合花粉算法求解全局优化问题

Hybrid Flower Pollination Algorithm For Solving Global Optimization Problems

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价