A Hybrid Method Based on Cuckoo Search Algorithm for Global Optimization Problems
Cuckoo search algorithm is considered one of the promising metaheuristic algorithms applied to solve numerous problems in different fields. However, it undergoes the premature convergence problem for high dimensional problems because the algorithm converges rapidly. Therefore, we proposed a robust a...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Universiti Utara Malaysia Press
2018
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/29162/1/JICT%2017%2003%202018%20469-491.pdf https://repo.uum.edu.my/id/eprint/29162/ https://doi.org/10.32890/jict2018.17.3.8261 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Cuckoo search algorithm is considered one of the promising metaheuristic algorithms applied to solve numerous problems in different fields. However, it undergoes the premature convergence problem for high dimensional problems because the algorithm converges rapidly. Therefore, we proposed a robust approach to solve this issue by hybridizing optimization algorithm, which is a combination of Cuckoo search algorithm and Hill climbing called CSAHC discovers many local optimum traps by using local and global searches, although the local search method is trapped at the local minimum point. In other words, CSAHC has the ability to balance between the global exploration of the CSA and the deep exploitation of the HC method. The validation of the performance is determined by applying 13 benchmarks. The results of experimental simulations prove the improvement in the efficiency and the effect of the cooperation strategy and the promising of CSAHC. |
|---|