Flower pollination algorithm (FPA) is a novel metaheuristic optimization algorithm with quick convergence, but its population diversity and convergence precision can be limited in some problems. In order to enhance its exploitation and exploration abilities, in this paper a novel hybrid flower pollination algorithm with Tabu Search (TS-FPA) has been applied to unconstrained optimization problems. TS-FPA is validated by ten benchmark functions. The results show that the proposed algorithm is able to obtained accurate solution, and it also has a fast convergence speed and a high degree of stability.
M. Hezam, Ibrahim; Abdel-Baset, Mohamed; and M. Hassan, Bayoumi
"A Hybrid Flower Pollination Algorithm with Tabu Search for Unconstrained Optimization Problems,"
Information Sciences Letters: Vol. 5
, Article 4.
Available at: https://digitalcommons.aaru.edu.jo/isl/vol5/iss1/4