A Hybrid Flower Pollination Algorithm with Tabu Search for Unconstrained Optimization Problems

Authors

Ibrahim M. Hezam, Department of computer, Faculty of Education, Ibb University, Ibb city, Yemen.Follow
Mohamed Abdel-Baset, Operations Research Department, Faculty of Computers &Informatics, Zagazig University, Sharqiyah, Egypt.Follow
Bayoumi M. Hassan, Decision Support Department, Faculty of Computers & Information, Cairo University, Cairo, Egypt.Follow

Abstract

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.

Recommended Citation

M. Hezam, Ibrahim; Abdel-Baset, Mohamed; and M. Hassan, Bayoumi (2016) "A Hybrid Flower Pollination Algorithm with Tabu Search for Unconstrained Optimization Problems," Information Sciences Letters: Vol. 5 : Iss. 1 , PP -.
Available at: https://digitalcommons.aaru.edu.jo/isl/vol5/iss1/4