Skip to main content
SpringerLink
Log in

A novel modified flower pollination algorithm for global optimization

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

Abstract

The flower pollination algorithm (FPA) is a relatively new natural bio-inspired optimization algorithm that mimics the real-life processes of the flower pollination. Indeed, this algorithm is based globally on two main rules: the global pollination (biotic and cross-pollination) and the local pollination (abiotic and self-pollination). The random permutation between these latter allows to keep a permanent balance between intensification and diversification. However, this procedure causes an involuntary orientation toward a bad solution (local optima). In addition, FPA illustrates an inadequacy in terms of intensification and diversification of new solutions; this has become clear when the complexity of the treated problem is increased. Further, FPA has also another insufficiency, which is its slow convergence rate caused in principle by its weak intensification. In this paper, to overcome these weaknesses, we have introduced some modifications on the basic FPA algorithmic structure based on the two following improvements: (1) Generating a set of global orientations (toward global or local pollination) for all members of the population. Indeed, each element (global orientation) in this set is composed of a fixed number (equal to the population size) of sub-random orientation. Thus, the number of elements is fixed by the designer, which enhances significantly the diversification characteristic. (2) Constructing a set of best solution vectors relating to all generated global orientations. In fact, this set is compared at each iteration to a fixed number of actual solution vectors to select the best among them based on their fitness values. The proposed algorithm called novel modified FPA (NMFPA) with its novel algorithmic structure offers to researchers the opportunity to: (1) use it in their comparison study (e.g., with others FPA proposed variants) and (2) develop other new methods or techniques based on its novel integrated mechanisms. To demonstrate the performance of this new FPA variant, a set of 28 benchmark functions defined in IEEE-CEC’13 and a 15 real-world numerical optimization problems proposed in the IEEE-CEC’11 are employed. Compared with FPA, two its famous variants and other state-of-the-art evolutionary algorithms, NMFPA shows overall better performance.

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
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Yang X-S (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, Hoboken

    Book  Google Scholar 

  2. Xhafa F, Abraham A (2008) Metaheuristics for scheduling in industrial and manufacturing applications series: studies in computational intelligence. Springer, Berlin

    Book  MATH  Google Scholar 

  3. Chandrasekaran C, Rajendran C, Krishnaiah Chetty OV, Hanumanna D (2007) Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach. Eur J Ind Eng 2:1751–5262

    Google Scholar 

  4. Almuhaideb S, El-Bachir Menai M (2013) Hybrid metaheuristics for medical data classification. In: El-Ghazali T (ed) Hybrid metaheuristics. Springer, Berlin, pp 187–217

    Chapter  Google Scholar 

  5. Ekrem D, Mitat U, Ali FA (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65–77

    Article  MathSciNet  Google Scholar 

  6. Kaveh A, Khayatazad M (2012) A new metaheuristic method: ray optimization. Comput Struct 112:283–294

    Article  Google Scholar 

  7. Tang R, Fong S, Yang X-S, Deb S (2012) Wolf search algorithm with ephemeral memory. In: IEEE seventh international conference on digital information management (ICDIM 2012), 22–24 August 2012, Macau, pp 165–172

  8. Gandomi AH, Alavi AH (2012) Krill Herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17:4831–4845

    Article  MathSciNet  MATH  Google Scholar 

  9. Pan WT (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl Based Syst 26:69–74

    Article  Google Scholar 

  10. Eskandar H, Sadollah A, Bahreininejad A, Hamdi M (2012) Water cycle algorithm—a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput Struct 110–111:151–166

    Article  Google Scholar 

  11. Yang X-S (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J, Jonoska N (eds) Unconventional computation and natural computation, vol 7445. Springer, Berlin, Heidelberg, pp 240–249

    Chapter  Google Scholar 

  12. Civicioglu P (2013) Artificial cooperative search algorithm for numerical optimization problems. Inf Sci 229:58–76

    Article  MATH  Google Scholar 

  13. Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13:2592–2612

    Article  Google Scholar 

  14. Kaveh A, Farhoudi N (2013) A new optimization method: dolphin echolocation. Adv Eng Softw 59:53–70

    Article  Google Scholar 

  15. Cheng MY, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. Kaveh A (2014) Colliding bodies optimization Advances in metaheuristic algorithms for optimal design of structures. Springer, Berlin, pp 195–232

    Book  Google Scholar 

  18. Ghaemi M, Feizi Derakhshi MR (2014) Forest optimization algorithm. Expert Syst Appl 41:6676–6687

    Article  Google Scholar 

  19. Gandomi AH, Yang X-S (2014) Chaotic bat algorithm. J Comput Sci 2:224–232

    Article  MathSciNet  Google Scholar 

  20. Wang GG, Deb S, Cui Z (2015) Monarch butterfly optimization. Neural Comput Appl 28:1–20

    Google Scholar 

  21. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98

    Article  Google Scholar 

  22. Kashan AH (2015) A new metaheuristic for optimization: optics inspired optimization (OIO). Comput Opera Res 55:99–125

    Article  MathSciNet  MATH  Google Scholar 

  23. Gonçalves S, Lopez H, Miguel F (2015) Search group algorithm: a new metaheuristic method for the optimization of truss structures. Comput Struct 153:165–184

    Article  Google Scholar 

  24. Dögan B, Ölmez T (2015) A new metaheuristic for numerical function optimization : vortex search algorithm. Inf Sci 293:125–145

    Article  Google Scholar 

  25. Ma L, Zhu Y, Liu Y, Tain L, Chen H (2015) A novel bionic algorithm inspired by plant root foraging behaviors. Appl Soft Comput 37:95–113

    Article  Google Scholar 

  26. Yu JJQ, Li VOK (2015) A social spider algorithm for global optimization. Appl Soft Comput 30:614–627

    Article  Google Scholar 

  27. Uymaz SA, Tezel G, Yel E (2015) Artificial algae algorithm (AAA) for nonlinear global optimization. Appl Soft Comput 31:153–171

    Article  Google Scholar 

  28. Mirjalili S (2016) Dragonfly algorithm: a new metaheuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27:1053–1073

    Article  Google Scholar 

  29. Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Soft 95:51–67

    Article  Google Scholar 

  30. Alam DF, Yousri DA, Eteiba MB (2016) Flower pollination algorithm based solar PV parameter estimation. Energy Convers Manag 101:410–422

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  33. 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–584

    Article  Google Scholar 

  34. Draa A (2016) On the performances of the flower pollination algorithm: qualitative and quantitative analyses. Appl Soft Comput 34:349–371

    Article  Google Scholar 

  35. Zhou Y, Wang R, Luo Q (2015) Elite opposition-based flower pollination algorithm. Neurocomputing 188:294–310

    Article  Google Scholar 

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

    Article  Google Scholar 

  37. Pavlyukevich I (2007) Levy flights, non-local search and simulated annealing. J Comput Phys 226:1830–1844

    Article  MathSciNet  MATH  Google Scholar 

  38. Dubey HM, Pandit M, Panigrahi B (2015) Hybrid flower pollination algorithm with time-varying fuzzy selection mechanism for wind integrated multi-objective dynamic economic dispatch. Renew Energy 83:188–202

    Article  Google Scholar 

  39. Liang J, Qu B, Suganthan P, Hernández-Daz AG (2013) Problem definitions and evaluation criteria for the CEC2013 special session on real-parameter optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Nanyang Technological University, Singapore, Technical Report 201212

  40. Das S, Suganthan P (2011) Problem definitions and evaluation criteria for CEC2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University and Nanyang Technological University, Technical Report

  41. Yang X-S, Karamanoglu M, He X (2013) Flower pollination algorithm: a novel approach for multiobjective optimization. Eng Optim 46:1222–1237

    Article  MathSciNet  Google Scholar 

  42. Clerc M (2011) Standard particle swarm optimisation. Technical Report

  43. Garcia-Martinez C, Lozano M, Herrera F, Molina D, Sanchez A (2008) Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur J Oper Res 185:1088–1113

    Article  MATH  Google Scholar 

  44. Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9:159–195

    Article  Google Scholar 

  45. Wang H, Wu Z, Liu Y, Wang J, Jiang D, Chen L (2009) Space transformation search: a new evolutionary technique. In: Proceedings of genetic and evolutionary computation conference, GEC summit, pp 537–544

  46. Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Proceedings of the 2005 international conference on computational intelligence for modelling, control and automation, pp 695–701

  47. Elsayed S, Sarker R, Essam D (2011) GA with a new multi-parent crossover for solving IEEE-CEC2011 competition problems. IEEE congress on evolutionary computation. Louisiana, New Orleans, pp 1034–1040

    Google Scholar 

  48. Lynn N, Suganthan PN (2015) Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation. Swarm Evol Comput 24:11–24

    Article  Google Scholar 

  49. Mallipeddi R, Suganthan PN (2011) Ensemble differential evolution algorithm for CEC2011 problems. In: IEEE congress on evolutionary computation, New Orleans, LA, pp 1557–1564

  50. Zambrano-Bigiarini M, Clerc M (2013) Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements. In: Proceedings of the IEEE congress on evolutionary computation, pp 2337–2344

  51. Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics 1:80–83

    Article  MathSciNet  Google Scholar 

  52. Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3–18

    Article  Google Scholar 

  53. Esposito WR, Floudas CA (2000) Deterministic global optimization in nonlinear optimal control problems. J Glob Optim 17:97–126

    Article  MathSciNet  MATH  Google Scholar 

  54. Ali MM, Storey C, Törn A (1997) Application of stochastic global optimization algorithms to practical problems. J Optim Theory Appl 95:545–563

    Article  MathSciNet  MATH  Google Scholar 

  55. Dukic ML, Dobrosavljevic ZS (1990) A method of a spread-spectrum radar polyphase code design. IEEE J Sel Areas Commun 8:743–749

    Article  Google Scholar 

  56. Pérez-Bellido AM, Salcedo-Sanz S, Ortiz-Garcîa EG, Portilla-Figueras JA, Lopez-Ferreras F (2008) A comparison of memetic algorithms for the spread spectrum radar polyphase codes design problems. Eng Appl Artif Intell 21(8):1233–1238

    Article  Google Scholar 

  57. Das S, Verma A, Bijwe PR (2017) Transmission network expansion planning using a modified artificial bee colony algorithm. Int Trans Electr Energ Syst 27(9):1–23

    Article  Google Scholar 

  58. Gallego LA, Garcés LP, Rahmani M, Romero RA (2016) High-performance hybrid genetic algorithm to solve transmission network expansion planning. IET Gener Transm Dis 11(5):1111–1118

    Article  Google Scholar 

  59. Galiana FD, Conejo AJ, Gil HA (2003) Transmission network cost allocation based on equivalent bilateral exchanges. IEEE Trans Power Syst 18(4):1425–1431

    Article  Google Scholar 

  60. Christie RD, Wollenberg BF, Wangensteen I (2000) Transmission management in the deregulated environment. Proc IEEE 88(2):170–195

    Article  Google Scholar 

  61. Huaning Wu, Chao Liu, Xu X (2014) Pattern synthesis of planar nonuniform circular antenna arrays using a chaotic adaptive invasive weed optimization algorithm. Math Probl Eng 1–13

  62. Ram G, Mandal D, Kar R, Ghoshal SP (2014) Optimal design of non-uniform circular antenna arrays using PSO with wavelet mutation. Int J Bio-Inspir Comput 6(6):424–433

    Article  Google Scholar 

  63. Elattar EE (2015) A hybrid genetic algorithm and bacterial foraging approach for dynamic economic dispatch problem. Int J Electr Power Energy Syst 69:18–26

    Article  Google Scholar 

  64. Dehnavi E, Abdi H (2016) Optimal pricing in time of use demand response by integrating with dynamic economic dispatch problem. Energy 109:1086–1094

    Article  Google Scholar 

  65. Dashti DR, Ghabeli A, Hosseini SM (2016) Solving static economic load dispatch using improved exponential harmony search optimisation. Aust J Electr Electron Eng 13(2):142–150

    Article  Google Scholar 

  66. Zhang H, Zhou J, Zhang Y, Lu Y, Wang Y (2013) Culture belief based multi-objective hybrid differential evolutionary algorithm in short term hydrothermal scheduling. Energy Convers Manag 65:173–184

    Article  Google Scholar 

  67. Vinko T, Izzo D (2008) Global optimisation heuristics and test problems for preliminary spacecraft trajectory design. Technical report, GOHTPPSTD, European Space Agency (ESA), the Advanced Concepts Team

  68. Biscani F, Izzo D, Yam C (2010) A global optimisation toolbox for massively parallel engineering optimisation. In: Proceedings of the international conference on astrodynamics tools and techniques (ICATT)

  69. El-Shahat D, Abdel-Basset M, El-Henawy I, Sangaiah AK (2017) A modifed flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Comput 1–19

  70. Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2017) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput Appl 1–16

  71. Abdel-Basset M, Wang G-G, Sangaiah AK, Rushdy E (2017) Krill herd algorithm based on cuckoo search for solving engineering optimization problems. Multimed Tools Appl 1–24

  72. Srikanth K, Panwar LK, Panigrahi BK, Herrera-Viedma E, Sangaiah AK, Wang GG (2017) Meta-heuristic framework: quantum inspired binary grey wolf optimizer for unit commitment problem. Comput Electr Eng 1–18

Download references

Acknowledgements

Xiao-Zhi Gao’s research is a part of the DIGI-USER research platform of Lappeenranta University of Technology, Finland.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University Abbes Laghrour, Khenchela, Algeria

    Allouani Fouad

  2. Machine Vision and Pattern Recognition Laboratory, Lappeenranta University of Technology, Lappeenranta, Finland

    Xiao-Zhi Gao

Authors
  1. Allouani Fouad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao-Zhi Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Allouani Fouad.

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

Fouad, A., Gao, XZ. A novel modified flower pollination algorithm for global optimization. Neural Comput & Applic 31, 3875–3908 (2019). https://doi.org/10.1007/s00521-017-3313-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-017-3313-0

Keywords

Search

Navigation