Skip to main content

Flower Pollination Algorithm Based on Beetle Antennae Search Method

  • Conference paper
  • First Online:
Smart Communications, Intelligent Algorithms and Interactive Methods

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 257))

Abstract

In this paper, a new flower pollination algorithm based on beetle antennae search method (TBFPA) is proposed to deal with the slow convergence speed problem of traditional flower pollination algorithm. Specifically, after the new individuals are generated by the way of flower pollination algorithm, the beetle antennae search method is used to search the nearby solution space of the new individuals, thus increasing the probability to reach better solutions and speeding up the convergence speed of the algorithm. In addition, a new uniform distribution sampling method is used to generate the initial population so as to spread the initial solutions all over the solution space. In order to verify the effectiveness of TBFPA, different standard functions are tested between TBFPA and FPA algorithms and the results proved that TBFPA has faster convergence speed and stronger global searchability.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Yang, X.S.: Flower pollination algorithm for global optimization. Unconventional Computation and Natural Computation. Lecture Notes in Computer Science, vol. 7445, pp. 240–249 (2012)

    Google Scholar 

  2. Zhou, Y., Wang, Luo, Q.: Elite opposition-based flower pollination algorithm. Neurocomputin 188, 94–310 (2016)

    Google Scholar 

  3. Xiao, H., Wan, C., Duan, Y., Tan, Q.: Flower pollination algorithm based on gravity search mechanism. J. Automatica Sinica 43(4), 576–594 (2017)

    Google Scholar 

  4. Xiao, H.: A flower pollination algorithm based on simplex method and self-adaptive step. Comput. Eng. Sci. 38(10), 2126–2133 (2016)

    Google Scholar 

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

    Google Scholar 

  6. Chen, T., Yin, H., Jiang, H.: Particle Swarm optimization algorithm based on Beetle Antennae search for solving portfolio problem. Comput. Syst. Appl. 28(2), 171–176 (2019)

    Google Scholar 

  7. Zhao, Y., Qian, Q.: Novel Chaos Beetle Swarm searching algorithm with learning and competitive strategies. Commun. Technol. 51(11), 60–66 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qian Qian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhou, J., Qian, Q., Fu, Y., Feng, Y. (2022). Flower Pollination Algorithm Based on Beetle Antennae Search Method. In: Jain, L.C., Kountchev, R., Hu, B., Kountcheva, R. (eds) Smart Communications, Intelligent Algorithms and Interactive Methods. Smart Innovation, Systems and Technologies, vol 257. Springer, Singapore. https://doi.org/10.1007/978-981-16-5164-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-5164-9_22

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-5163-2

  • Online ISBN: 978-981-16-5164-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics