Application of mutation operators to flower pollination algorithm

A new concept based on mutation operators is applied to flower pollination algorithm (FPA).Based on mutation, five new variants of FPA are proposed.Dynamic switch probability is used in all the proposed variants.Benchmarking of Variants with respect to standard FPA.Benchmarking and statistical testing of the best variant with respect to state-of-the-art algorithms. Flower pollination algorithm (FPA) is a recent addition to the field of nature inspired computing. The algorithm has been inspired from the pollination process in flowers and has been applied to a large spectra of optimization problems. But it has certain drawbacks which prevents its applications as a standard algorithm. This paper proposes new variants of FPA employing new mutation operators, dynamic switching and improved local search. A comprehensive comparison of proposed algorithms has been done for different population sizes for optimizing seventeen benchmark problems. The best variant among these is adaptive-Lvy flower pollination algorithm (ALFPA) which has been further compared with the well-known algorithms like artificial bee colony (ABC), differential evolution (DE), firefly algorithm (FA), bat algorithm (BA) and grey wolf optimizer (GWO). Numerical results show that ALFPA gives superior performance for standard benchmark functions. The algorithm has also been subjected to statistical tests and again the performance is better than the other algorithms.

[1]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[2]  Saku Kukkonen,et al.  Real-parameter optimization with differential evolution , 2005, 2005 IEEE Congress on Evolutionary Computation.

[3]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[4]  Rohit Salgotra,et al.  A novel bat flower pollination algorithm for synthesis of linear antenna arrays , 2016, Neural Computing and Applications.

[5]  Ilya Pavlyukevich.  Lévy flights, non-local search and simulated annealing , 2007, J. Comput. Phys..

[6]  Xin Yao,et al.  An Analysis of Evolutionary Algorithms Based on Neighborhood and Step Sizes , 1997, Evolutionary Programming.

[7]  N. Rajasekar,et al.  A Novel Flower Pollination Based Global Maximum Power Point Method for Solar Maximum Power Point Tracking , 2017, IEEE Transactions on Power Electronics.

[8]  Patricia Melin,et al.  Flower Pollination Algorithm with Fuzzy Approach for Solving Optimization Problems , 2017, Nature-Inspired Design of Hybrid Intelligent Systems.

[9]  Carlos Alberto Ochoa Ortíz Zezzatti,et al.  Implementing flower multi-objective algorithm for selection of university academic credits , 2014, 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014).

[10]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[11]  Nazmus Sakib,et al.  A Comparative Study of Flower Pollination Algorithm and Bat Algorithm on Continuous Optimization Problems , 2014 .

[12]  Dervis Karaboga,et al.  Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems , 2007, IFSA.

[13]  Andries Petrus Engelbrecht,et al.  Self-adaptive Differential Evolution , 2005, CIS.

[14]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[15]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[16]  Andrew Lewis,et al.  Grey Wolf Optimizer , 2014, Adv. Eng. Softw..

[17]  Walter J. Gutjahr,et al.  Convergence Analysis of Metaheuristics , 2010, Matheuristics.

[18]  L. Chittka,et al.  Flower Constancy, Insect Psychology, and Plant Evolution , 1999, Naturwissenschaften.

[19]  Seyed Mohammad Mirjalili,et al.  The Ant Lion Optimizer , 2015, Adv. Eng. Softw..

[20]  Xin-She Yang,et al.  Multi-Objective Flower Algorithm for Optimization , 2014, ICCS.

[21]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[22]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[23]  Xin Yao,et al.  Evolutionary algorithms with adaptive Levy mutations , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[24]  Dan Simon,et al.  Biogeography-Based Optimization , 2022 .

[25]  Rui Wang,et al.  Elite opposition-based flower pollination algorithm , 2016, Neurocomputing.

[26]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[27]  Andrew Lewis,et al.  Grasshopper Optimisation Algorithm: Theory and application , 2017, Adv. Eng. Softw..

[28]  Sasongko Pramono Hadi,et al.  Flower pollination algorithm for optimal control in multi-machine system with GUPFC , 2014, 2014 6th International Conference on Information Technology and Electrical Engineering (ICITEE).

[29]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[30]  Yongquan Zhou,et al.  Flower Pollination Algorithm with Dimension by Dimension Improvement , 2014 .

[31]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[32]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[33]  Piotr A. Kowalski,et al.  Study of Flower Pollination Algorithm for Continuous Optimization , 2014, IEEE Conf. on Intelligent Systems.

[34]  Oindrilla Dutta,et al.  DE-FPA: A hybrid differential evolution-flower pollination algorithm for function minimization , 2014, 2014 International Conference on High Performance Computing and Applications (ICHPCA).

[35]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[36]  Emad Nabil,et al.  A Modified Flower Pollination Algorithm for Global Optimization , 2016, Expert Syst. Appl..

[37]  Amer Draa,et al.  On the performances of the flower pollination algorithm - Qualitative and quantitative analyses , 2015, Appl. Soft Comput..

[38]  M. Balasingh Moses,et al.  Flower Pollination Algorithm Applied for Different Economic Load Dispatch Problems , 2014 .

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

[40]  Günter Rudolph,et al.  Local convergence rates of simple evolutionary algorithms with Cauchy mutations , 1997, IEEE Trans. Evol. Comput..

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

[42]  Hesham N. Elmahdy,et al.  Flower Pollination Optimization Algorithm for Wireless Sensor Network Lifetime Global Optimization , 2014, SOCO 2014.

[43]  Rohit Salgotra,et al.  Synthesis of linear antenna array using flower pollination algorithm , 2016, Neural Computing and Applications.

[44]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[45]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[46]  Jouni Lampinen,et al.  A Fuzzy Adaptive Differential Evolution Algorithm , 2005, Soft Comput..

[47]  H. Abbass.  The self-adaptive Pareto differential evolution algorithm , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[48]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.