An Improved Flower Pollination Algorithm for Global and Local Optimization

M. Iqbal Kamboh - Faculty of Computer Science & Information Technology, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Johor, Malaysia
Nazri Bin Mohd Nawi - Faculty of Computer Science & Information Technology, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Johor, Malaysia
Azizul Azhar Ramli - Faculty of Computer Science & Information Technology, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Johor, Malaysia
Fanni Sukma - Department of Information Technology, Politeknik Negeri Padang, West Sumatera, Indonesia

Citation Format:



Meta-heuristic algorithms have emerged as a powerful optimization tool for handling non-smooth complex optimization problems and also to address engineering and medical issues. However, the traditional methods face difficulty in tackling the multimodal non-linear optimization problems within the vast search space. In this paper, the Flower Pollination Algorithm has been improved using Dynamic switch probability to enhance the balance between exploitation and exploration for increasing its search ability, and the swap operator is used to diversify the population, which will increase the exploitation in getting the optimum solution. The performance of the improved algorithm has investigated on benchmark mathematical functions, and the results have been compared with the Standard Flower pollination Algorithm (SFPA), Genetic Algorithm, Bat Algorithm, Simulated annealing, Firefly Algorithm and Modified flower pollination algorithm. The ranking of the algorithms proves that our proposed algorithm IFPDSO has outperformed the above-discussed nature-inspired heuristic algorithms.


Dynamic switch probability; meta-heuristic; benchmark function; multimodal; exploitation; exploration.

Full Text:



J. Holland, “Adaptation in natural and artificial systems: an introductory analysis with application to biology,” Control Artif. Intell., 1975.

H. A. Firpi and R. J. Vogelstein, “Particle swarm optimization-based feature selection for cognitive state detection,” Proc. Annu. Int. Conf. IEEE Eng. Med. Biol. Soc. EMBS, pp. 6556–6559, 2011.

Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001.

M. Dorigo, “Optimization, learning and natural algorithms,” PhD Thesis, Politec. di Milano, 1992.

D. Karaboga, “Artificial bee colony algorithm,” scholarpedia, vol. 5, no. 3, p. 6915, 2010.

Y. Halim and C. E. Nugraheni, “A Bee Colony Algorithm based Solver for Flow Shop Scheduling Problem,” JOIV Int. J. Informatics Vis., vol. 5, no. 2, 2021.

X. S. Yang and S. Deb, “Cuckoo search via Lévy flights,” 2009 World Congr. Nat. Biol. Inspired Comput. NABIC 2009 - Proc., pp. 210–214, 2009.

X.-S. Yang, “A new metaheuristic bat-inspired algorithm,” in Nature inspired cooperative strategies for optimization (NICSO 2010), Springer, 2010, pp. 65–74.

X.-S. Yang, “Firefly algorithm, stochastic test functions and design optimisation,” arXiv Prepr. arXiv1003.1409, 2010.

B. Dimitris and S. John, “Simulated annealing.pdf,” Statistical Science, vol. 8, no. 1. pp. 10–15, 1993.

A. K. Qin, V. L. Huang, and P. N. Suganthan, “Differential evolution algorithm with strategy adaptation for global numerical optimization,” IEEE Trans. Evol. Comput., vol. 13, no. 2, pp. 398–417, 2008.

X. S. Yang, “Flower pollination algorithm for global optimization,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 7445 LNCS, pp. 240–249, 2012.

M. I. Kamboh, N. Mohd Nawi, and R. Bt. Mohamad, “An improved flower pollination solution for economic dispatch with valve point effect,” Indones. J. Electr. Eng. Comput. Sci., vol. 22, no. 2, p. 629, 2021.

M. M. Sidhu and S. Mehta, “Hybrid Gravitational Search Flower Pollination Algorithm for Combined Economic Emission Load Dispatch,” Int. Res. J. Eng. Technol., vol. 4, no. 7, pp. 1485–1493, 2017.

M. Abdel-Baset and I. Hezam, “A Hybrid Flower Pollination Algorithm for Engineering Optimization Problems,” Int. J. Comput. Appl., vol. 140, no. 12, pp. 10–23, 2016.

D. Chakraborty, S. Saha, and O. Dutta, “DE-FPA: A hybrid differential evolution-flower pollination algorithm for function minimization,” 2014 Int. Conf. High Perform. Comput. Appl. ICHPCA 2014, 2015.

G. E. Yuliastuti and A. M. Rizki, “Optimization of Multi-Product Aggregate Production Planning using Hybrid Simulated Annealing and Adaptive Genetic Algorithm,” vol. 10, no. 11, pp. 484–489, 2019.

E. Nabil, “A Modified Flower Pollination Algorithm for Global Optimization,” Expert Syst. Appl., vol. 57, pp. 192–203, 2016.

S. Abdel-Fattah Sayed, E. Nabil, and A. Badr, “A binary clonal flower pollination algorithm for feature selection,” Pattern Recognit. Lett., vol. 77, pp. 21–27, 2016.

R. Wang and Y. Zhou, “Flower pollination algorithm with dimension by dimension improvement,” Math. Probl. Eng., vol. 2014, 2014.

H. M. Dubey, M. Pandit, and B. K. Panigrahi, “Hybrid flower pollination algorithm with time-varying fuzzy selection mechanism for wind integrated multi-objective dynamic economic dispatch,” Renew. Energy, vol. 83, pp. 188–202, 2015.

W. Zhang, Z. Qu, K. Zhang, W. Mao, Y. Ma, and X. Fan, “A combined model based on CEEMDAN and modified flower pollination algorithm for wind speed forecasting,” Energy Convers. Manag., vol. 136, pp. 439–451, 2017.

R. Salgotra and U. Singh, “Application of mutation operators to flower pollination algorithm,” Expert Syst. Appl., vol. 79, pp. 112–129, 2017.

R. Wang, Y. Zhou, C. Zhao, and H. Wu, “A hybrid flower pollination algorithm based modified randomized location for multi-threshold medical image segmentation,” Biomed. Mater. Eng., vol. 26, pp. S1345–S1351, 2015.

L. Zhang, L. Zhang, S. Liu, J. Zhou, and C. Papavassiliou, “Three-Dimensional Underwater Path Planning Based on Modified Wolf Pack Algorithm,” IEEE Access, vol. 5, pp. 22783–22795, 2017.

A. Mishra and S. Deb, “Assembly sequence optimization using a flower pollination algorithm-based approach,” J. Intell. Manuf., vol. 30, no. 2, pp. 461–482, 2019.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

JOIV : International Journal on Informatics Visualization
ISSN 2549-9610  (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
W :
E :,,

View JOIV Stats

Creative Commons License is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.