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.
CITATION STYLE
Lei, M., Luo, Q., Zhou, Y., Tang, C., & Gao, Y. (2019). BFPA: Butterfly Strategy Flower Pollination Algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11643 LNCS, pp. 739–748). Springer Verlag. https://doi.org/10.1007/978-3-030-26763-6_71
Mendeley helps you to discover research relevant for your work.