Skip to main content

BFPA: Butterfly Strategy Flower Pollination Algorithm

  • Conference paper
  • First Online:
Intelligent Computing Theories and Application (ICIC 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11643))

Included in the following conference series:

Abstract

Aiming at the shortcomings of slow convergence and low precision of flower pollination algorithm, a flower pollination algorithm based on butterfly pollination strategy (BFPA) was proposed. The algorithm first uses the butterfly pollination strategy to accelerate the convergence speed of the global search phase. Second, in the local search phase, the beetle antenna search help algorithm is used to jump out of the local optimum. The experiment uses five Benchmark test functions to test, and the results show that the BFPA algorithm has better performance than other versions of the pollination algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, vol. IV, pp. 1942–1948 (1995)

    Google Scholar 

  2. Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24(4), 656–667 (1994)

    Article  Google Scholar 

  3. Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Eur. J. Oper. Res. 185(3), 1155–1173 (2008)

    Article  MathSciNet  Google Scholar 

  4. Yang, X.-S.: Flower pollination algorithm for global optimization. In: Durand-Lose, J., Jonoska, N. (eds.) UCNC 2012. LNCS, vol. 7445, pp. 240–249. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32894-7_27

    Chapter  Google Scholar 

  5. Sankalap, A., Satvir, S.: Butterfly optimization algorithm: a novel approach for global optimization. Soft Comput. 23(3), 715–734 (2018). https://doi.org/10.1007/s00500-018-3102-4

    Article  MATH  Google Scholar 

  6. Jiang, X., Li, S.: BAS: beetle antennae search algorithm for optimization problems. Int. J. Robot. Control 1(1), 1–5 (2018)

    Article  MathSciNet  Google Scholar 

  7. Lu, K., Li, H.: Quantum-behaved flower pollination algorithm. In: 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (2015). https://doi.org/10.1109/dcabes.2015.24

  8. Ram, J.P., Babu, T.S., Dragicevic, T., Rajasekar, N.: A new hybrid bee pollinator flower pollination algorithm for solar PV parameter estimation. Energy Convers. Manag. 135, 463–476 (2017)

    Article  Google Scholar 

  9. Sayed, S.A.F., Nabil, E., Badr, A.: A binary clonal flower pollination algorithm for feature selection. Pattern Recogn. Lett. 77, 21–27 (2016)

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by National Science Foundation of China under Grant No. 61563008. Project of Guangxi University for Nationalities Science Foundation under Grant No. 2018GXNSFAA138146.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qifang Luo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lei, M., Luo, Q., Zhou, Y., Tang, C., Gao, Y. (2019). BFPA: Butterfly Strategy Flower Pollination Algorithm. In: Huang, DS., Bevilacqua, V., Premaratne, P. (eds) Intelligent Computing Theories and Application. ICIC 2019. Lecture Notes in Computer Science(), vol 11643. Springer, Cham. https://doi.org/10.1007/978-3-030-26763-6_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26763-6_71

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26762-9

  • Online ISBN: 978-3-030-26763-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics