A comparative study of cuckoo search and flower pollination algorithm on solving global optimization problems
Abstract
Purpose
The purpose of this paper is to present a comparison between two well-known Lévy-based meta-heuristics called cuckoo search (CS) and flower pollination algorithm (FPA).
Design/methodology/approach
Both the algorithms (Lévy-based meta-heuristics called CS and Flower Pollination) are tested on selected benchmarks from CEC 2017. In addition, this study discussed all CS and FPA comparisons that were included implicitly in other works.
Findings
The experimental results show that CS is superior in global convergence to the optimal solution, while FPA outperforms CS in terms of time complexity.
Originality/value
This paper compares the working flow and significance of FPA and CS which seems to have many similarities in order to help the researchers deeply understand the differences between both algorithms. The experimental results are clearly shown to solve the global optimization problem.
Keywords
Citation
Abdel-Basset, M., Shawky, L.A. and Sangaiah, A.K. (2017), "A comparative study of cuckoo search and flower pollination algorithm on solving global optimization problems", Library Hi Tech, Vol. 35 No. 4, pp. 588-601. https://doi.org/10.1108/LHT-04-2017-0077
Publisher
:Emerald Publishing Limited
Copyright © 2017, Emerald Publishing Limited