Skip to main content
SpringerLink
Log in

Analysing the effects of various switching probability characteristics in flower pollination algorithm for solving unconstrained function minimization problems

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Due to their unique offerings, bio-inspired algorithms have become popular in problem solving. Flower pollination algorithm (FPA), which is relatively a new member of this family, is shown to be one promising algorithm and this optimizer is still open to possible enhancements. One of the reasons that adds to the popularity of FPA is indeed the simplicity in implementation. It has two basic procedures, namely global and local pollination, which correspond to global and local search, respectively. Moreover, a single parameter, referred to as switching probability, puts control on these search procedures. Thus, the mentioned switching probability actually defines the search characteristics throughout generations, which directly affects the success of FPA. Accordingly, the present work analyses the effects of various switching probability characteristics, including exponentially, linearly and sawtooth changing patterns. This is the main motivation of the present study. Secondarily, a systematically intensifying step size procedure, which is commonly ignored by most of the stochastic search algorithms, is adopted along with these strategies. The aim of the proposed step size function is to encourage a more intensified search towards the end, while providing a more diversified search at the initialization stage to avoid local optima and premature convergence. Thus, more promising results might be obtained. All developed modifications are tested by using well-known unconstrained function minimization problems. As demonstrated by several nonparametric statistical tests, results point out significant improvements over the standard FPA.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  2. Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory, In: Proceedings of IEEE the sixth international symposium on micro machine and human science, pp 39–43

  3. Storn R, Price K (1995) Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces, Technical report TR-95-012, ICSI. Available via ftp from ftp.icsi.berkeley.edu/pub/techreports/1995/tr-95-012.ps.Z

  4. Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst 22(3):2–67

    MathSciNet  Google Scholar 

  5. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471

    Article  MathSciNet  Google Scholar 

  6. Yang XS (2009) Firefly algorithms for multimodal optimization. In: Watanabe O, Zeugmann T (eds) Lecture notes in computer sciences. Springer, Berlin, pp 169–178

    Google Scholar 

  7. Yang, XS, Deb S (2009) Cuckoo search via Lévy flights. In: proceedings of IEEE world congress on nature and biologically inspired computing, pp 210–214

  8. Krishnanand KN, Ghose D (2009) Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell US 3(2):87–124

    Article  Google Scholar 

  9. Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Cruz C, González JR, Krasnogor N, Pelta DA, Terrazas G (eds) Studies in computational intelligence. Springer, Berlin, pp 65–74

    Google Scholar 

  10. Tang R, Fong S, Yang XS, Deb S (2012) Wolf search algorithm with ephemeral memory. In: proceedings of IEEE international conference on digital information management (ICDIM), pp 165–72

  11. Yang XS (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J, Jonoska N (eds) Unconventional computation and natural computation. UCNC 2012. Lecture notes in computer science, vol 7445. Springer, Berlin, Heidelberg

  12. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Article  Google Scholar 

  13. Baykasoğlu A, Akpinar Ş (2015) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems-part 2: constrained optimization. Appl Soft Comput 37:396–415

    Article  Google Scholar 

  14. Baykasoğlu A, Akpinar Ş (2017) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems—part 1: unconstrained optimization. Appl Soft Comput 56:520–540

    Article  Google Scholar 

  15. Banati H, Chaudhary R (2017) Multi-modal bat algorithm with improved search (MMBAIS). J Comput Sci 23:130–144

    Article  MathSciNet  Google Scholar 

  16. Dinkar SK, Deep K (2017) Opposition based Laplacian ant lion optimizer. J Comput Sci 23:71–90

    Article  MathSciNet  Google Scholar 

  17. Yang XS, Deb S, He X (2013) Eagle strategy with flower algorithm. In: Proceedings of IEEE international conference on advances in computing, communications and informatics (ICACCI), pp 1213–1217

  18. Yang XS, Karamanoglu M, He X (2014) Flower pollination algorithm: a novel approach for multiobjective optimization. Eng Optim 46(9):1222–1237

    Article  MathSciNet  Google Scholar 

  19. Abdel-Raouf O, Abdel-Baset M (2014) A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int J Appl Oper Res Open Access J 4(2):1–13

    Google Scholar 

  20. Chakraborty D, Saha S, Dutta O (2014) DE-FPA: a hybrid differential evolution-flower pollination algorithm for function minimization. In: Proceedings of IEEE international conference on high performance computing and applications (ICHPCA), pp 1–6

  21. Dubey HM, Pandit M, Panigrahi BK (2015) A biologically inspired modified flower pollination algorithm for solving economic dispatch problems in modern power systems. Cognit Comput 7(5):594–608

    Article  Google Scholar 

  22. Bensouyad M, Saidouni D (2015) A discrete flower pollination algorithm for graph coloring problem. In: Proceedings IEEE international conference on cybernetics (CYBCONF), pp 151–155

  23. Sayed SAF, Nabil E, Badr A (2016) A binary clonal flower pollination algorithm for feature selection. Pattern Recognit Lett 77:21–27

    Article  Google Scholar 

  24. Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192–203

    Article  Google Scholar 

  25. Rodrigues D, Silva GF, Papa JP, Marana AN, Yang XS (2016) EEG-based person identification through binary flower pollination algorithm. Expert Syst Appl 62:81–90

    Article  Google Scholar 

  26. Rodrigues D, Yang XS, De Souza AN, Papa JP (2015) Binary flower pollination algorithm and its application to feature selection. In: Yang X-S (ed) Studies in computational intelligence. Springer, Berlin, pp 85–100

    Google Scholar 

  27. Draa A (2015) On the performances of the flower pollination algorithm-Qualitative and quantitative analyses. Appl Soft Comput 34:349–371

    Article  Google Scholar 

  28. Bekdaş G, Nigdeli SM, Yang XS (2015) Sizing optimization of truss structures using flower pollination algorithm. Appl Soft Comput 37:322–331

    Article  Google Scholar 

  29. Pan JS, Dao TK, Chu SC, Pan TS (2016) Dynamic diversity population based flower pollination algorithm for multimodal optimization. In: Nguyen NT, Trawiński B, Fujita H, Hong T-P (eds) Intelligent information and database systems. Springer, Berlin, pp 440–448

    Chapter  Google Scholar 

  30. Kalra S, Arora S (2016) Firefly algorithm hybridized with flower pollination algorithm for multimodal functions. In: Proceedings of the international congress on information and communication technology, pp 207–219

  31. Salgotra R, Singh U (2017) Application of mutation operators to flower pollination algorithm. Expert Syst App 79:112–129

    Article  Google Scholar 

  32. Agarwal P, Mehta S (2016) Enhanced flower pollination algorithm on data clustering. Int J Comput Appl 38(2–3):144–155

    Google Scholar 

  33. Jensi R, Jiji GW (2015) Hybrid data clustering approach using k-means and flower pollination algorithm. arXiv preprint arXiv:1505.03236

  34. Łukasik S, Kowalski PA, Charytanowicz M, Kulczycki P (2016) Clustering using flower pollination algorithm and Calinski–Harabasz index. In: Proceedings of IEEE congress on evolutionary computation (CEC), pp 2724–2728

  35. Wang R, Zhou Y, Qiao S, Huang K (2016) Flower pollination algorithm with bee pollinator for cluster analysis. Inf Process Lett 116(1):1–14

    Article  Google Scholar 

  36. Abdel-Basset M, Shawky LA, Sangaiah AK (2017) A comparative study of cuckoo search and flower pollination algorithm on solving global optimization problems. Libr HiTech 35(4):595–608

    Google Scholar 

  37. Abdel-Basset M, El-Shahat D, El-Henawy I et al (2018) A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Comput 22:4221. https://doi.org/10.1007/s00500-017-2744-y

  38. Chiroma H, Shuib NLM, Muaz SA, Abubakar AI, Ila LB, Maitama JZ (2015) A review of the applications of bio inspired flower pollination algorithm. Proc Comput Sci 62:435–441

    Article  Google Scholar 

  39. Duan H, Qiao P (2014) Pigeon-inspired optimization: a new swarm intelligence optimizer for air robot path planning. Int J Intell Comput Cybern 7(1):24–37

    Article  MathSciNet  Google Scholar 

  40. Kechmane L, Nsiri B, Baalal A (2018) A hybrid particle swarm optimization algorithm for the capacitated location routing problem. Int J Intell Comput Cybern 11(1):106–120

    Article  Google Scholar 

  41. Xian N, Chen Z (2018) A quantum-behaved pigeon-inspired optimization approach to explicit nonlinear model predictive controller for quadrotor. Int J Intell Comput Cybern 11(1):47–63

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Faculty of Engineering, Dokuz Eylül University, Izmir, Turkey

    Fehmi Burcin Ozsoydan & Adil Baykasoglu

Authors
  1. Fehmi Burcin Ozsoydan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adil Baykasoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fehmi Burcin Ozsoydan.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ozsoydan, F.B., Baykasoglu, A. Analysing the effects of various switching probability characteristics in flower pollination algorithm for solving unconstrained function minimization problems. Neural Comput & Applic 31, 7805–7819 (2019). https://doi.org/10.1007/s00521-018-3602-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-018-3602-2

Keywords

Search

Navigation