A Hybrid Cuckoo Search and Simulated Annealing Algorithm
Simulated annealing (SA) proved its success as a single-state optimization search algorithm for both discrete and continuous problems. On the contrary, cuckoo search (CS) is one of the well-known population-based search algorithms that could be used for optimizing some problems with continuous domai...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2019-09-01
|
| Series: | Journal of Intelligent Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jisys-2017-0268 |
| _version_ | 1818716625512169472 |
|---|---|
| author | Alkhateeb Faisal Abed-alguni Bilal H. |
| author_facet | Alkhateeb Faisal Abed-alguni Bilal H. |
| author_sort | Alkhateeb Faisal |
| collection | DOAJ |
| description | Simulated annealing (SA) proved its success as a single-state optimization search algorithm for both discrete and continuous problems. On the contrary, cuckoo search (CS) is one of the well-known population-based search algorithms that could be used for optimizing some problems with continuous domains. This paper provides a hybrid algorithm using the CS and SA algorithms. The main goal behind our hybridization is to improve the solutions generated by CS using SA to explore the search space in an efficient manner. More precisely, we introduce four variations of the proposed hybrid algorithm. The proposed variations together with the original CS and SA algorithms were evaluated and compared using 10 well-known benchmark functions. The experimental results show that three variations of the proposed algorithm provide a major performance enhancement in terms of best solutions and running time when compared to CS and SA as stand-alone algorithms, whereas the other variation provides a minor enhancement. Moreover, the experimental results show that the proposed hybrid algorithms also outperform some well-known optimization algorithms. |
| first_indexed | 2024-12-17T19:22:14Z |
| format | Article |
| id | doaj.art-5f1d0913dde64d0e842cd333127c961f |
| institution | Directory Open Access Journal |
| issn | 0334-1860 2191-026X |
| language | English |
| last_indexed | 2024-12-17T19:22:14Z |
| publishDate | 2019-09-01 |
| publisher | De Gruyter |
| record_format | Article |
| series | Journal of Intelligent Systems |
| spelling | doaj.art-5f1d0913dde64d0e842cd333127c961f2022-12-21T21:35:29ZengDe GruyterJournal of Intelligent Systems0334-18602191-026X2019-09-0128468369810.1515/jisys-2017-0268A Hybrid Cuckoo Search and Simulated Annealing AlgorithmAlkhateeb Faisal0Abed-alguni Bilal H.1Department of Computer Sciences, Yarmouk University, Irbid, JordanDepartment of Computer Sciences, Yarmouk University, Irbid, JordanSimulated annealing (SA) proved its success as a single-state optimization search algorithm for both discrete and continuous problems. On the contrary, cuckoo search (CS) is one of the well-known population-based search algorithms that could be used for optimizing some problems with continuous domains. This paper provides a hybrid algorithm using the CS and SA algorithms. The main goal behind our hybridization is to improve the solutions generated by CS using SA to explore the search space in an efficient manner. More precisely, we introduce four variations of the proposed hybrid algorithm. The proposed variations together with the original CS and SA algorithms were evaluated and compared using 10 well-known benchmark functions. The experimental results show that three variations of the proposed algorithm provide a major performance enhancement in terms of best solutions and running time when compared to CS and SA as stand-alone algorithms, whereas the other variation provides a minor enhancement. Moreover, the experimental results show that the proposed hybrid algorithms also outperform some well-known optimization algorithms.https://doi.org/10.1515/jisys-2017-0268cuckoo searchsimulated annealing searchoptimizationmetaheuristic68t01 |
| spellingShingle | Alkhateeb Faisal Abed-alguni Bilal H. A Hybrid Cuckoo Search and Simulated Annealing Algorithm Journal of Intelligent Systems cuckoo search simulated annealing search optimization metaheuristic 68t01 |
| title | A Hybrid Cuckoo Search and Simulated Annealing Algorithm |
| title_full | A Hybrid Cuckoo Search and Simulated Annealing Algorithm |
| title_fullStr | A Hybrid Cuckoo Search and Simulated Annealing Algorithm |
| title_full_unstemmed | A Hybrid Cuckoo Search and Simulated Annealing Algorithm |
| title_short | A Hybrid Cuckoo Search and Simulated Annealing Algorithm |
| title_sort | hybrid cuckoo search and simulated annealing algorithm |
| topic | cuckoo search simulated annealing search optimization metaheuristic 68t01 |
| url | https://doi.org/10.1515/jisys-2017-0268 |
| work_keys_str_mv | AT alkhateebfaisal ahybridcuckoosearchandsimulatedannealingalgorithm AT abedalgunibilalh ahybridcuckoosearchandsimulatedannealingalgorithm AT alkhateebfaisal hybridcuckoosearchandsimulatedannealingalgorithm AT abedalgunibilalh hybridcuckoosearchandsimulatedannealingalgorithm |