A Novel Flower Pollination Algorithm based on Genetic Algorithm Operators

The Flower Pollination Algorithm (FPA) is a new natural bio-inspired optimization algorithm that mimics the real-life processes of the flower pollination. Thus, the latter has a quick convergence, but its population diversity and convergence precision can be limited in some applications. In order to improve its intensification (exploitation) and diversification (exploration) abilities, we have introduced a simple modification in its general structure. More precisely, we have added both Crossover and Mutation Genetic Algorithm (GA) operators respectively, just after calculating the new candidate solutions and the greedy selection operation in its basic structure. The proposed method, called FPA-GA has been tested on all the CEC2005 contest test instances. Experimental results show that FPA-GA is very competitive. Keywords— flower pollination algorithm, crossover, mutation, genetic algorithm (GA)

[1]  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..

[2]  Xin-She Yang,et al.  Swarm Intelligence and Bio-Inspired Computation , 2013 .

[3]  Arthur C. Sanderson,et al.  JADE: Adaptive Differential Evolution With Optional External Archive , 2009, IEEE Transactions on Evolutionary Computation.

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

[5]  De-Shuang Huang,et al.  A Neural Root Finder of Polynomials Based on Root Moments , 2004, Neural Computation.

[6]  Qingfu Zhang,et al.  Differential Evolution With Composite Trial Vector Generation Strategies and Control Parameters , 2011, IEEE Transactions on Evolutionary Computation.

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

[8]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

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

[10]  Marco Dorigo,et al.  Ant colony optimization for continuous domains , 2008, Eur. J. Oper. Res..

[11]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[14]  A. Mucherino,et al.  Monkey search: a novel metaheuristic search for global optimization , 2007 .

[15]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

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

[17]  Xiaodong Li,et al.  Swarm Intelligence in Optimization , 2008, Swarm Intelligence.

[18]  Xin-She Yang,et al.  Multiobjective firefly algorithm for continuous optimization , 2012, Engineering with Computers.

[19]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

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

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

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