Advertisement

Modified Global Flower Pollination Algorithm and its Application for Optimization Problems

  • Moh’d Khaled Yousef Shambour
  • Ahmed A. Abusnaina
  • Ahmed I. Alsalibi
Original Research Article

Abstract

Flower Pollination Algorithm (FPA) has increasingly attracted researchers’ attention in the computational intelligence field. This is due to its simplicity and efficiency in searching for global optimality of many optimization problems. However, there is a possibility to enhance its search performance further. This paper aspires to develop a new FPA variant that aims to improve the convergence rate and solution quality, which will be called modified global FPA (mgFPA). The mgFPA is designed to better utilize features of existing solutions through extracting its characteristics, and direct the exploration process towards specific search areas. Several continuous optimization problems were used to investigate the positive impact of the proposed algorithm. The eligibility of mgFPA was also validated on real optimization problems, where it trains artificial neural networks to perform pattern classification. Computational results show that the proposed algorithm provides satisfactory performance in terms of finding better solutions compared to six state-of-the-art optimization algorithms that had been used for benchmarking.

Keywords

Flower Pollination Algorithm Computational intelligent Optimization problems Exploration Artificial neural networks 

References

  1. 1.
    Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT Press, CambridgeGoogle Scholar
  2. 2.
    Kennedy J (2011) Particle swarm optimization. In: Encyclopedia of machine learning. Springer, New York, pp 760–766Google Scholar
  3. 3.
    Kirkpatrick S, Gelatt CD, Vecchi MP et al (1983) Optimization by simulated annealing. Science 220(4598):671–680CrossRefPubMedGoogle Scholar
  4. 4.
    Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Global Optim 39(3):459–471CrossRefGoogle Scholar
  5. 5.
    Yang X-S, Deb S (2009) Cuckoo search via lévy flights. In: Nature & Biologically Inspired Computing. NaBIC 2009. World Congress on, IEEE, pp 210–214Google Scholar
  6. 6.
    Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRefGoogle Scholar
  7. 7.
    Yang X-S (2010) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio Inspir Comput 2(2):78–84CrossRefGoogle Scholar
  8. 8.
    Yang X-S (2010) A new metaheuristic bat-inspired algorithm, Nature inspired cooperative strategies for optimization (NICSO 2010), pp 65–74Google Scholar
  9. 9.
    Yang X-S (2012) Flower pollination algorithm for global optimization. In: UCNC. Springer, New York, pp 240–249Google Scholar
  10. 10.
    Wang R, Zhou Y, Zhao C, Wu H (2015) A hybrid flower pollination algorithm based modified randomized location for multi-threshold medical image segmentation. Bio Med Mater Eng 26(s1):S1345–S1351CrossRefGoogle Scholar
  11. 11.
    Ouadfel S, Taleb-Ahmed A (2016) Social spiders optimization and flower pollination algorithm for multilevel image thresholding: a performance study. Expert Syst Appl 55:566–584CrossRefGoogle Scholar
  12. 12.
    Rodrigues D, Yang X-S, De Souza AN, Papa JP (2015) Binary flower pollination algorithm and its application to feature selection. In: Recent advances in swarm intelligence and evolutionary computation. Springer, New York, pp 85–100Google Scholar
  13. 13.
    Sayed SA-F, Nabil E, Badr A (2016) A binary clonal flower pollination algorithm for feature selection. Pattern Recogn Lett 77:21–27CrossRefGoogle Scholar
  14. 14.
    Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192–203CrossRefGoogle Scholar
  15. 15.
    Souza ROG, Oliveira ES, Junior ICS, Marcato ALM, de Olveira MT (2017) Flower pollination algorithm applied to the economic dispatch problem with multiple fuels and valve point effect. In: Portuguese Conference on Artificial Intelligence. Springer, New York, pp 260–270Google Scholar
  16. 16.
    Shilaja C, Ravi K (2017) Optimization of emission/economic dispatch using euclidean affine flower pollination algorithm (efpa) and binary fpa (bfpa) in solar photo voltaic generation. Renew Energy 107:550–566CrossRefGoogle Scholar
  17. 17.
    Abdelaziz A, Ali E, Elazim SA (2016) Flower pollination algorithm to solve combined economic and emission dispatch problems. Eng Sci Technol Int J 19(2):980–990CrossRefGoogle Scholar
  18. 18.
    Abdel-Baset M, Wu H, Zhou Y (2017) A complex encoding flower pollination algorithm for constrained engineering optimisation problems. Int J Math Model Numer Optim 8(2):108–126Google Scholar
  19. 19.
    Abdel-Raouf O, Abdel-Baset M et al (2014) A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int J Appl Oper Res Open Access J 4(2):1–13Google Scholar
  20. 20.
    Goyal S, Patterh MS (2015) Flower pollination algorithm based localization of wireless sensor network. In: Recent Advances in Engineering & Computational Sciences (RAECS), 2015 2nd International Conference on. IEEE, pp 1–5Google Scholar
  21. 21.
    Kaur R, Arora S (2018) Nature inspired range based wireless sensor node localization algorithms. Int J Interact Multimed Artif Intell 4(Regular Issue)Google Scholar
  22. 22.
    Kayabekir AE, Bekdaş G, Nigdeli SM, Yang X-S (2018) A comprehensive review of the flower pollination algorithm for solving engineering problems. In: Nature-Inspired Algorithms and Applied Optimization. Springer, New York, pp 171–188Google Scholar
  23. 23.
    Alyasseri ZAA, Khader AT, Al-Betar MA, Awadallah MA, Yang X-S (2018) Variants of the flower pollination algorithm: a review:91–118Google Scholar
  24. 24.
    Pant S, Kumar A, Ram M (2017) Flower pollination algorithm development: a state of art review. Int J Syst Assur Eng Manag 8(2):1858–1866CrossRefGoogle Scholar
  25. 25.
    Patnaik S, Yang X, Nakamatsu K (2017) Nature-inspired computing and optimization: theory and applications, modeling and optimization in science and technologies. Springer International Publishing, New York. https://books.google.com.sa/books?id=dFVKDgAAQBAJ
  26. 26.
    Abdel-Basset M, Shawky LA, Sangaiah AK (2017) A comparative study of cuckoo search and flower pollination algorithm on solving global optimization problems. Library Hi Tech 35(4):595–608CrossRefGoogle Scholar
  27. 27.
    Awad N, Ali M, Liang J, Qu B, Suganthan P (2016) Problem definitions and evaluation criteria for the cec 2017 special session and competition on single objective bound constrained real-parameter numerical optimization. In: Technical Report. NTU, SingaporeGoogle Scholar
  28. 28.
    Zhou Y, Wang R, Luo Q (2016) Elite opposition-based flower pollination algorithm. Neurocomputing 188:294–310CrossRefGoogle Scholar
  29. 29.
    Tang K, Yáo X, Suganthan PN, MacNish C, Chen Y-P, Chen C-M, Yang Z (2007) Benchmark functions for the cec2008 special session and competition on large scale global optimization. In: Nature Inspired Computation and Applications Laboratory. USTC, p 24Google Scholar
  30. 30.
    Salgotra R, Singh U (2017) Application of mutation operators to flower pollination algorithm. Expert Syst Appl 79:112–129CrossRefGoogle Scholar
  31. 31.
    Xu S, Wang Y, Huang F (2017) Optimization of multi-pass turning parameters through an improved flower pollination algorithm. Int J Adv Manuf Technol 89(1–4):503–514CrossRefGoogle Scholar
  32. 32.
    Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2–4):311–338CrossRefGoogle Scholar
  33. 33.
    Otsu N (1979) A threshold selection method from gray-level histograms. IEEE Trans Syst Man Cybern 9(1):62–66CrossRefGoogle Scholar
  34. 34.
    Abdel-Baset M, Hezam IM (2015) An effective hybrid flower pollination and genetic algorithm for constrained optimization problems. Adv Eng Technol Appl Int J 4:27–27Google Scholar
  35. 35.
    Lazim D, Zain AM, Bahari M, Omar AH (2017) Review of modified and hybrid flower pollination algorithms for solving optimization problems. Artif Intell Rev:1–31Google Scholar
  36. 36.
    Shambour MKY (2017) Dynamic search zones (dsz) for harmony search algorithm. In: 2017 8th International Conference on Information Technology (ICIT), pp 941–946Google Scholar
  37. 37.
    Shambour MKY (2018) Vibrant search mechanism (vsm) for numerical optimization functions. J Inf Commun Technol (JICT) 17:21Google Scholar
  38. 38.
    Abualigah LM, Khader AT, Hanandeh ES (2017) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Comput Sci:11Google Scholar
  39. 39.
    Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773–4795CrossRefGoogle Scholar
  40. 40.
    Jamil M, Yang X-S (2013) A literature survey of benchmark functions for global optimisation problems. Int J Math Model Numer Optim 4(2):150–194Google Scholar
  41. 41.
    (2017) Virtual library of simulation experiments: test functions and datasets. https://www.sfu.ca
  42. 42.
    Ghosh-Dastidar S, Adeli H (2009) A new supervised learning algorithm for multiple spiking neural networks with application in epilepsy and seizure detection. Neural Netw 22(10):1419–1431CrossRefPubMedGoogle Scholar
  43. 43.
    Bache K, Lichman M (2018) Uci machine learning repositoryGoogle Scholar
  44. 44.
    Abusnaina AA, Abdullah R, Kattan A (2014) Enhanced MWO training algorithm to improve classification accuracy of artificial neural networks. Springer International Publishing, New York, pp 183–194Google Scholar
  45. 45.
    Abusnaina AA, Abdullah R (2013) Mussels wandering optimization algorithm based training of artificial neural networks for pattern classification. In: Proceedings of the 4th International Conference on Computing and Informatics. ICOCI, pp 78–85Google Scholar
  46. 46.
    Gómez D, Rojas A (2016) An empirical overview of the no free lunch theorem and its effect on real-world machine learning classification. Neural Comput 28(1):216–228CrossRefPubMedGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  • Moh’d Khaled Yousef Shambour
    • 1
  • Ahmed A. Abusnaina
    • 2
  • Ahmed I. Alsalibi
    • 3
  1. 1.The Custodian of the Two Holy Mosques Institute for Hajj and Umrah ResearchUmm Al-Qura UniversityMakkahSaudi Arabia
  2. 2.Department Of Computer ScienceBirzeit UniversityRamallahPalestine
  3. 3.Israa UniversityGazaPalestine

Personalised recommendations