In this paper, two hybrid schemes using cuckoo search algorithm and genetic algorithm are proposed. In the two hybrid schemes, the algorithm consists of two phases in the first phase, CS (or GA) explores the search space. In the second phase, to improve global search and get rid of trapping into several local optima. The novel hybrid algorithms are applied to solve 15 benchmark functions chosen from literature. The simulation results and comparison with classical CS and GA algorithms confirm the effectiveness of the proposed algorithms in solving various benchmark optimization functions.
Digital Object Identifier (DOI)
Abdel-Baset, Mohamed and Hezam, Ibrahim
"Cuckoo Search and Genetic Algorithm Hybrid Schemes for Optimization Problems,"
Applied Mathematics & Information Sciences: Vol. 10:
3, Article 37.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol10/iss3/37