{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:45:25Z","timestamp":1781109925455,"version":"3.54.1"},"reference-count":33,"publisher":"Walter de Gruyter GmbH","issue":"4","license":[{"start":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T00:00:00Z","timestamp":1507161600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1515\/jisys-2017-0268","type":"journal-article","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T06:01:22Z","timestamp":1507183282000},"page":"683-698","source":"Crossref","is-referenced-by-count":25,"title":["A Hybrid Cuckoo Search and Simulated Annealing Algorithm"],"prefix":"10.1515","volume":"28","author":[{"given":"Faisal","family":"Alkhateeb","sequence":"first","affiliation":[{"name":"Department of Computer Sciences , Yarmouk University , Irbid , Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bilal H.","family":"Abed-alguni","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences , Yarmouk University , Irbid , Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"374","published-online":{"date-parts":[[2017,10,5]]},"reference":[{"key":"2025120523491478243_j_jisys-2017-0268_ref_001_w2aab3b7c13b1b6b1ab1b5b1Aa","unstructured":"B. H. Abed-alguni, Bat q-learning algorithm, Jord. J. Comput. Inf. Technol.3 (2017), 56\u201377."},{"key":"2025120523491478243_j_jisys-2017-0268_ref_002_w2aab3b7c13b1b6b1ab1b5b2Aa","doi-asserted-by":"crossref","unstructured":"B. H. Abed-alguni and F. Alkhateeb, Novel selection schemes for cuckoo search, Arab. J. Sci. Eng.42 (2017), 3635\u20133654.10.1007\/s13369-017-2663-3","DOI":"10.1007\/s13369-017-2663-3"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_003_w2aab3b7c13b1b6b1ab1b5b3Aa","unstructured":"B. H. Abed-Alguni, D. J. Paul, S. K. Chalup and F. A. Henskens, A comparison study of cooperative q-learning algorithms for independent learners, Int. J. Artif. Intell.14 (2016), 71\u201393."},{"key":"2025120523491478243_j_jisys-2017-0268_ref_004_w2aab3b7c13b1b6b1ab1b5b4Aa","doi-asserted-by":"crossref","unstructured":"V. \u010cern\u00fd, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, J. Optim. Theory Appl.45 (1985), 41\u201351.10.1007\/BF00940812","DOI":"10.1007\/BF00940812"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_005_w2aab3b7c13b1b6b1ab1b5b5Aa","doi-asserted-by":"crossref","unstructured":"Y. Feng, G.-G. Wang and X.-Z. Gao, A novel hybrid cuckoo search algorithm with global harmony search for 0-1 knapsack problems, Int. J. Comput. Intell. Syst.9 (2016), 1174\u20131190.10.1080\/18756891.2016.1256577","DOI":"10.1080\/18756891.2016.1256577"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_006_w2aab3b7c13b1b6b1ab1b5b6Aa","doi-asserted-by":"crossref","unstructured":"B. H. F. Hasan, I. A. Doush, E. Al Maghayreh, F. Alkhateeb and M. Hamdan, Hybridizing harmony search algorithm with different mutation operators for continuous problems, Appl. Math. Comput.232 (2014), 1166\u20131182.","DOI":"10.1016\/j.amc.2013.12.139"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_007_w2aab3b7c13b1b6b1ab1b5b7Aa","doi-asserted-by":"crossref","unstructured":"K. Huang, Y. Zhou, X. Wu and Q. Luo, A cuckoo search algorithm with elite opposition-based strategy, J. Intell. Syst.25 (2016), 567\u2013593.","DOI":"10.1515\/jisys-2015-0041"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_008_w2aab3b7c13b1b6b1ab1b5b8Aa","doi-asserted-by":"crossref","unstructured":"W. Kartous, A. Layeb and S. Chikhi, A new quantum cuckoo search algorithm for multiple sequence alignment, J. Intell. Syst.23 (2014), 261\u2013275.","DOI":"10.1515\/jisys-2013-0052"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_009_w2aab3b7c13b1b6b1ab1b5b9Aa","unstructured":"A. Khachaturyan, S. Semenovskaya and B. Vainstein, A statistical-thermodynamic approach to determination of structure amplitude phases, Sov. Phys. Crystallogr.24 (1979), 519\u2013524."},{"key":"2025120523491478243_j_jisys-2017-0268_ref_010_w2aab3b7c13b1b6b1ab1b5c10Aa","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, Optimization by simulated annealing, Science220 (1983), 671\u2013680.10.1126\/science.220.4598.671","DOI":"10.1126\/science.220.4598.671"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_011_w2aab3b7c13b1b6b1ab1b5c11Aa","doi-asserted-by":"crossref","unstructured":"Q. Liao, S. Zhou, H. Shi and W. Shi, Parameter estimation of nonlinear systems by dynamic cuckoo search, Neural Comput.29 (2017), 1103\u20131123.10.1162\/NECO_a_00946","DOI":"10.1162\/NECO_a_00946"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_012_w2aab3b7c13b1b6b1ab1b5c12Aa","doi-asserted-by":"crossref","unstructured":"A. Lim, B. Rodrigues and X. Zhang, A simulated annealing and hill-climbing algorithm for the traveling tournament problem, Eur. J. Oper. Res.174 (2006), 1459\u20131478.10.1016\/j.ejor.2005.02.065","DOI":"10.1016\/j.ejor.2005.02.065"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_013_w2aab3b7c13b1b6b1ab1b5c13Aa","doi-asserted-by":"crossref","unstructured":"C. Liu and J. Wang, Cell formation and task scheduling considering multi-functional resource and part movement using hybrid simulated annealing, Int. J. Comput. Intell. Syst.9 (2016), 765\u2013777.10.1080\/18756891.2016.1204123","DOI":"10.1080\/18756891.2016.1204123"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_014_w2aab3b7c13b1b6b1ab1b5c14Aa","doi-asserted-by":"crossref","unstructured":"M. Lundy, Applications of the annealing algorithm to combinatorial problems in statistics, Biometrika72 (1985), 191\u2013198.10.1093\/biomet\/72.1.191","DOI":"10.1093\/biomet\/72.1.191"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_015_w2aab3b7c13b1b6b1ab1b5c15Aa","doi-asserted-by":"crossref","unstructured":"M. Marichelvam, An improved hybrid cuckoo search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems, Int. J. Bio-Inspired Comput.4 (2012), 200\u2013205.10.1504\/IJBIC.2012.048061","DOI":"10.1504\/IJBIC.2012.048061"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_016_w2aab3b7c13b1b6b1ab1b5c16Aa","doi-asserted-by":"crossref","unstructured":"M. Marichelvam and M. Geetha, A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times, Int. J. Comput. Complex. Intell. Algorithms1 (2016), 23\u201334.","DOI":"10.1504\/IJCCIA.2016.077463"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_017_w2aab3b7c13b1b6b1ab1b5c17Aa","doi-asserted-by":"crossref","unstructured":"M. Marichelvam and \u00d6. Tosun, Performance comparison of cuckoo search algorithm to solve the hybrid flow shop scheduling benchmark problems with makespan criterion. Int. J. Swarm Intell. Res.7 (2016), 1\u201314.10.4018\/IJSIR.2016040101","DOI":"10.4018\/IJSIR.2016040101"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_018_w2aab3b7c13b1b6b1ab1b5c18Aa","doi-asserted-by":"crossref","unstructured":"M. Marichelvam, T. Prabaharan and X.-S. Yang, Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan, Appl. Soft Comput.19 (2014), 93\u2013101.10.1016\/j.asoc.2014.02.005","DOI":"10.1016\/j.asoc.2014.02.005"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_019_w2aab3b7c13b1b6b1ab1b5c19Aa","doi-asserted-by":"crossref","unstructured":"U. Mlakar and I. Fister, Hybrid self-adaptive cuckoo search for global optimization, Swarm Evol. Comput.29 (2016), 47\u201372.10.1016\/j.swevo.2016.03.001","DOI":"10.1016\/j.swevo.2016.03.001"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_020_w2aab3b7c13b1b6b1ab1b5c20Aa","doi-asserted-by":"crossref","unstructured":"P. Mohapatra, S. Chakravarty and P. Dash, An improved cuckoo search based extreme learning machine for medical data classification, Swarm Evol. Comput.24 (2015), 25\u201349.10.1016\/j.swevo.2015.05.003","DOI":"10.1016\/j.swevo.2015.05.003"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_021_w2aab3b7c13b1b6b1ab1b5c21Aa","doi-asserted-by":"crossref","unstructured":"M. G. H. Omran and M. Mahdavi, Global-best harmony search, Appl. Math. Comput.198 (2008), 643\u2013656.","DOI":"10.1016\/j.amc.2007.09.004"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_022_w2aab3b7c13b1b6b1ab1b5c22Aa","doi-asserted-by":"crossref","unstructured":"Q.-K. Pan, P. N. Suganthan, M. F. Tasgetiren and J. J. Liang, A self-adaptive global best harmony search algorithm for continuous optimization problems, Appl. Math. Comput.216 (2010), 830\u2013848.","DOI":"10.1016\/j.amc.2010.01.088"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_023_w2aab3b7c13b1b6b1ab1b5c23Aa","doi-asserted-by":"crossref","unstructured":"H. Rakhshani and A. Rahati, Intelligent multiple search strategy cuckoo algorithm for numerical and engineering optimization problems, Arab. J. Sci. Eng.42 (2017), 567. https:\/\/doi.org\/10.1007\/s13369-016-2270-8.10.1007\/s13369-016-2270-8","DOI":"10.1007\/s13369-016-2270-8"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_024_w2aab3b7c13b1b6b1ab1b5c24Aa","doi-asserted-by":"crossref","unstructured":"Z. Sheng, J. Wang, S. Zhou and B. Zhou, Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm, Chaos24 (2014), 013133.10.1063\/1.4867989","DOI":"10.1063\/1.4867989"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_025_w2aab3b7c13b1b6b1ab1b5c25Aa","doi-asserted-by":"crossref","unstructured":"N. Shivasankaran, P. S. Kumar, G. Nallakumarasamy and K. V. Raja, Repair shop job scheduling with parallel operators and multiple constraints using simulated annealing, Int. J. Comput. Intell. Syst.6 (2013), 223\u2013233.10.1080\/18756891.2013.768434","DOI":"10.1080\/18756891.2013.768434"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_026_w2aab3b7c13b1b6b1ab1b5c26Aa","doi-asserted-by":"crossref","unstructured":"N. Shivasankaran, P. S. Kumar and K. V. Raja, Hybrid sorting immune simulated annealing algorithm for flexible job shop scheduling, Int. J. Comput. Intell. Syst.8 (2015), 455\u2013466.10.1080\/18756891.2015.1017383","DOI":"10.1080\/18756891.2015.1017383"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_027_w2aab3b7c13b1b6b1ab1b5c27Aa","unstructured":"P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger and S. Tiwari, Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical Report KanGAL Report#2005005, IIT Kanpur, India, Nanyang Technological University, Singapore, 2005."},{"key":"2025120523491478243_j_jisys-2017-0268_ref_028_w2aab3b7c13b1b6b1ab1b5c28Aa","doi-asserted-by":"crossref","unstructured":"H. Szu and R. Hartley, Fast simulated annealing, Phys. Lett. A122 (1987), 157\u2013162.10.1016\/0375-9601(87)90796-1","DOI":"10.1016\/0375-9601(87)90796-1"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_029_w2aab3b7c13b1b6b1ab1b5c29Aa","doi-asserted-by":"crossref","unstructured":"X.-S. Yang, Bat algorithm and cuckoo search: a tutorial, in: Artificial Intelligence, Evolutionary Computing and Metaheuristics, pp. 421\u2013434, Springer, 2013.","DOI":"10.1007\/978-3-642-29694-9_17"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_030_w2aab3b7c13b1b6b1ab1b5c30Aa","doi-asserted-by":"crossref","unstructured":"X.-S. Yang and S. Deb, Cuckoo search via L\u00e9vy flights, in: World Congress on Nature & Biologically Inspired Computing, 2009, NaBIC 2009, pp. 210\u2013214, IEEE, 2009.","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_031_w2aab3b7c13b1b6b1ab1b5c31Aa","doi-asserted-by":"crossref","unstructured":"X.-S. Yang and S. Deb, Engineering optimisation by cuckoo search, Int. J. Math. Modell. Numer. Optim.1 (2010), 330\u2013343.","DOI":"10.1504\/IJMMNO.2010.035430"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_032_w2aab3b7c13b1b6b1ab1b5c32Aa","doi-asserted-by":"crossref","unstructured":"X.-S. Yang and A. Hossein Gandomi, Bat algorithm: a novel approach for global engineering optimization, Eng. Comput.29 (2012), 464\u2013483.10.1108\/02644401211235834","DOI":"10.1108\/02644401211235834"},{"key":"2025120523491478243_j_jisys-2017-0268_ref_033_w2aab3b7c13b1b6b1ab1b5c33Aa","doi-asserted-by":"crossref","unstructured":"Y.-R. Zeng, L. Peng, J. Zhang and L. Wang, An effective hybrid differential evolution algorithm incorporating simulated annealing for joint replenishment and delivery problem with trade credit, Int. J. Comput. Intell. Syst.9 (2016), 1001\u20131015.10.1080\/18756891.2016.1256567","DOI":"10.1080\/18756891.2016.1256567"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jisys.2019.28.issue-4\/jisys-2017-0268\/jisys-2017-0268.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0268\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0268\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:49:28Z","timestamp":1764978568000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0268\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,5]]},"references-count":33,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,9,23]]},"published-print":{"date-parts":[[2019,9,25]]}},"alternative-id":["10.1515\/jisys-2017-0268"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2017-0268","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"value":"2191-026X","type":"electronic"},{"value":"0334-1860","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10,5]]}}}