Adaptive Improved Flower Pollination Algorithm for Global Optimization

In the last few years, meta-heuristic-driven optimization algorithms have been employed to solve several problems since they can provide simple and elegant solutions. In this work, we introduced an improved adaptive version of the Flower Pollination Algorithm, which can dynamically change its parameter setting throughout the convergence process, as well as it keeps track of the best solutions. The effectiveness of the proposed approach is compared against with Bat Algorithm and Particle Swarm Optimization, as well as the naive version of the Flower Pollination Algorithm. The experimental results were carried out in nine benchmark functions available in literature and demonstrated to outperform the other techniques with faster convergence rate.

[1]  Xin-She Yang,et al.  Flower pollination algorithm: A novel approach for multiobjective optimization , 2014, ArXiv.

[2]  Corinna Cortes,et al.  Support-Vector Networks , 1995, Machine Learning.

[3]  Xin-She Yang,et al.  Handling dropout probability estimation in convolution neural networks using meta-heuristics , 2018, Soft Comput..

[4]  Rohit Salgotra,et al.  Application of mutation operators to flower pollination algorithm , 2017, Expert Syst. Appl..

[5]  Xin Yan,et al.  Linear Regression Analysis: Theory and Computing , 2009 .

[6]  João Paulo Papa,et al.  Efficient supervised optimum-path forest classification for large datasets , 2012, Pattern Recognit..

[7]  Yuhui Shi,et al.  Brain Storm Optimization Algorithm , 2011, ICSI.

[8]  João Paulo Papa,et al.  Supervised pattern classification based on optimum-path forest , 2009 .

[9]  Xin-She Yang,et al.  Learning Parameters in Deep Belief Networks Through Firefly Algorithm , 2016, ANNPR.

[10]  Sarjiya,et al.  Modified flower pollination algorithm for nonsmooth and multiple fuel options economic dispatch , 2016, 2016 8th International Conference on Information Technology and Electrical Engineering (ICITEE).

[11]  Mohamed Abdel-Basset,et al.  Flower pollination algorithm: a comprehensive review , 2018, Artificial Intelligence Review.

[12]  João Paulo Papa,et al.  Fine-tuning Deep Belief Networks using Harmony Search , 2016, Appl. Soft Comput..

[13]  Seyed-Alireza Ahmadi,et al.  Human behavior-based optimization: a novel metaheuristic approach to solve complex optimization problems , 2017, Neural Computing and Applications.

[14]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[15]  Xin-She Yang,et al.  Bat algorithm: a novel approach for global engineering optimization , 2012, 1211.6663.

[16]  Eid Emary,et al.  Applications of Flower Pollination Algorithm in Feature Selection and Knapsack Problems , 2018 .

[17]  Xin-She Yang,et al.  Binary Flower Pollination Algorithm and Its Application to Feature Selection , 2015, Recent Advances in Swarm Intelligence and Evolutionary Computation.

[18]  Gnanasekaran Namachivayam,et al.  Reconfiguration and Capacitor Placement of Radial Distribution Systems by Modified Flower Pollination Algorithm , 2016 .

[19]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[20]  Bijaya K. Panigrahi,et al.  A Biologically Inspired Modified Flower Pollination Algorithm for Solving Economic Dispatch Problems in Modern Power Systems , 2015, Cognitive Computation.

[21]  Yuxin Zhao,et al.  Global Convergence Analysis of the Flower Pollination Algorithm: A Discrete-Time Markov Chain Approach , 2018, ICCS.

[22]  D. Cox.  The Regression Analysis of Binary Sequences , 1958 .

[23]  Pedro M. Domingos,et al.  On the Optimality of the Simple Bayesian Classifier under Zero-One Loss , 1997, Machine Learning.

[24]  R. Mantegna,et al.  Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[25]  João Paulo Papa,et al.  Optimum-Path Forest based on k-connectivity: Theory and applications , 2017, Pattern Recognit. Lett..

[26]  John R. Koza,et al.  Genetic programming as a means for programming computers by natural selection , 1994 .

[27]  Xin-She Yang,et al.  EEG-based person identification through Binary Flower Pollination Algorithm , 2016, Expert Syst. Appl..

[28]  Xin-She Yang,et al.  A literature survey of benchmark functions for global optimisation problems , 2013, Int. J. Math. Model. Numer. Optimisation.

[29]  Xin-She Yang,et al.  Flower Pollination Algorithm for Global Optimization , 2012, UCNC.

[30]  Amit Konar,et al.  Differential Evolution Using a Neighborhood-Based Mutation Operator , 2009, IEEE Transactions on Evolutionary Computation.

[31]  Xin-She Yang,et al.  LibOPT: An Open-Source Platform for Fast Prototyping Soft Optimization Techniques , 2017, ArXiv.

[32]  João Paulo Papa,et al.  EEG-based Person Authentication Using Multi-objective Flower Pollination Algorithm , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[33]  Amr Badr,et al.  A binary clonal flower pollination algorithm for feature selection , 2016, Pattern Recognit. Lett..

[34]  Janez Brest,et al.  Modified firefly algorithm using quaternion representation , 2013, Expert Syst. Appl..

[35]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[36]  Xin-She Yang,et al.  Firefly algorithm, stochastic test functions and design optimisation , 2010, Int. J. Bio Inspired Comput..

[37]  Xin-She Yang,et al.  Quaternion-based Deep Belief Networks fine-tuning , 2017, Appl. Soft Comput..