{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T02:00:55Z","timestamp":1781920855596,"version":"3.54.5"},"reference-count":173,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda (CONACyT) Basic Science Project","doi-asserted-by":"publisher","award":["287479"],"award-info":[{"award-number":["287479"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004961","name":"ITESM Research Group with Strategic Focus in Intelligent Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004961","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3009318","type":"journal-article","created":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T20:50:04Z","timestamp":1594759804000},"page":"128068-128095","source":"Crossref","is-referenced-by-count":90,"title":["A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4067-2488","authenticated-orcid":false,"given":"Melissa","family":"Sanchez","sequence":"first","affiliation":[{"name":"School of Engineering and Sciences, Tecnológico de Monterrey, Monterrey, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4494-7864","authenticated-orcid":false,"given":"Jorge M.","family":"Cruz-Duarte","sequence":"additional","affiliation":[{"name":"School of Engineering and Sciences, Tecnológico de Monterrey, Monterrey, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-2166","authenticated-orcid":false,"given":"Jose Carlos","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[{"name":"School of Engineering and Sciences, Tecnológico de Monterrey, Monterrey, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2460-3442","authenticated-orcid":false,"given":"Hector","family":"Ceballos","sequence":"additional","affiliation":[{"name":"School of Engineering and Sciences, Tecnológico de Monterrey, Monterrey, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-0773","authenticated-orcid":false,"given":"Hugo","family":"Terashima-Marin","sequence":"additional","affiliation":[{"name":"School of Engineering and Sciences, Tecnológico de Monterrey, Monterrey, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-7137","authenticated-orcid":false,"given":"Ivan","family":"Amaya","sequence":"additional","affiliation":[{"name":"School of Engineering and Sciences, Tecnológico de Monterrey, Monterrey, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.37"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167245"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.38"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90006-6"},{"key":"ref169","volume":"8","author":"mackworth","year":"1977","journal-title":"Consistency in Networks of Relations"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790296"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8789928"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-016-9466-x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29828-8_16"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.12.006"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.10.008"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2883802"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2018.2807018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2991411"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.04.096"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.95.052309","article-title":"Hybrid annealing: Coupling a quantum simulator to a classical computer","volume":"95","author":"gra\u00df","year":"2017","journal-title":"Phys Rev A Gen Phys"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3928-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0037549716644055"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100643"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.anucene.2019.107214"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0229358"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2973696"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2019.07.010"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2960388"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46135-3_35"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21326-7_32"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611675114"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2429314"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.07.107"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2013.12.001"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2013.12.024"},{"key":"ref151","author":"hax","year":"1973","journal-title":"Hierarchical Integration of Production Planning and Scheduling"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.08.015"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1039-3"},{"key":"ref149","first-page":"703","article-title":"A genetic algorithm for flexible job shop scheduling","volume":"1","author":"chaudhry","year":"2013","journal-title":"Lect Notes Eng Comput Sci"},{"key":"ref59","author":"martello","year":"1990","journal-title":"Knapsack Problems Algorithms and Computer Implementations"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0025-9"},{"key":"ref57","first-page":"11","article-title":"Applications of bin packing models through the supply chain","volume":"1","author":"eliiyi","year":"2009","journal-title":"International Business Management"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.030"},{"key":"ref55","article-title":"Solving a new 3D bin packing problem with deep reinforcement learning method","author":"hu","year":"2017","journal-title":"arXiv 1708 05930"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55453-2_13"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-015-9428-8"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31137-6_46"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2906581"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498475"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258536"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref162","first-page":"889","article-title":"MAX MIN ant system","volume":"16","author":"hoos","year":"1999","journal-title":"Future Gener Comput Syst"},{"key":"ref161","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"‘Neural’ computation of decisions in optimization problems","volume":"52","author":"hopfield","year":"1985","journal-title":"Biol Cybern"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1201\/b18469-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/17415977.2016.1209747"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCPMT.2017.2706305"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-014-0275-2"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-03822-w"},{"key":"ref49","first-page":"336","article-title":"Case-based reasoning as a heuristic selector in a hyper-heuristic for course timetabling problems","volume":"82","author":"petrovic","year":"2002","journal-title":"Proc 6th Int Conf Knowl -Based Intell Inf Eng Syst Appl Technol (KES)"},{"key":"ref7","first-page":"1","article-title":"A primary study on hyper-heuristics to customise metaheuristics for continuous optimisation","author":"cruz-duarte","year":"2020","journal-title":"Proc IEEE Congr Evol Comput (CEC)"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2582745"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-017-9301-4"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00294-4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2008.10.003"},{"key":"ref48","first-page":"210","article-title":"Using case-based reasoning in an algorithm portfolio for constraint solving","author":"o\u2019mahony","year":"2008","journal-title":"Proc Irish Conf Artif Intell Cogn Sci"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_16"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.71"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00364-6"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2010.5453854"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz697"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1361\/1\/012038"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.08.020"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2020.105183"},{"key":"ref73","first-page":"13","article-title":"An improved tabu search algorithm for job shop scheduling problem trough hybrid solution representations","volume":"3","author":"fattahi","year":"2018","journal-title":"J Qual Eng Prod Optim"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.011"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1002\/net.21924"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.promfg.2019.02.006"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1038\/srep22307"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911540"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_14"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1043403"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-0761-4_25"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91341-4_8"},{"key":"ref75","first-page":"350","article-title":"Deep reinforcement learning as a job shop scheduling solver: A literature","volume":"923","author":"coelho","year":"2018","journal-title":"Proc Hybrid Intell Syst 18th Int Conf Hybrid Intell Syst (HIS)"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316300"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-013-0243-z"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.5267\/j.ijiec.2018.6.003"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33749-0_13"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77313-1_1"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.07.073"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-013-1377-x"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1137\/17M1140030"},{"key":"ref138","article-title":"A survey of shortest-path algorithms","author":"madkour","year":"2017","journal-title":"arXiv 1705 02044"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.100554"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00044"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/768\/7\/072035"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.04.043"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.7551\/978-0-262-31709-2-ch126"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1093\/imaman\/dpn004"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1108\/K-09-2013-0201"},{"key":"ref140","first-page":"213","article-title":"Maximum common subgraph isomorphism algorithms","volume":"77","author":"duesbury","year":"2017","journal-title":"MATCH"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-92198-3_7"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34029-2_19"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s11518-006-0149-z"},{"key":"ref142","first-page":"15","article-title":"Survey of algorithms on maximum clique problem","volume":"2","author":"singh","year":"2015","journal-title":"International Journal of Engineering Science & Advanced Technology"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00113-1"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111627"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.1.113"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.060"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/23311916.2018.1502242"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-017-1350-2"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2003.09.017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2856832"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/790\/1\/012093"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/ICGCCEE.2014.6921411"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.04.004"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.2478\/sbe-2019-0016"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-020-00702-0"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1080\/21642583.2019.1674220"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2018.11.013"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/646\/1\/012032"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.11.002"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.17485\/ijst\/2015\/v8i1\/84652"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.09.004"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_48"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1361\/1\/012034"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/ACIT.2018.8672677"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2019.11.134"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.3390\/a13020044"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.106682"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2009.12.003"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/4136430"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/6507054"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1282\/1\/012012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref11","first-page":"95","article-title":"SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization","volume":"1","author":"zitzler","year":"2001","journal-title":"Proc EUROGEN Conf Evol Methods Design Optim Control Appl Ind Problems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554717"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.12.050"},{"key":"ref14","volume":"1","author":"deb","year":"2001","journal-title":"Multi-Objective Optimization Using Evolutionary Algorithms"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5107"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.5267\/j.ijiec.2019.6.005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.05.020"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.05.029"},{"key":"ref117","doi-asserted-by":"crossref","first-page":"534","DOI":"10.3390\/app10020534","article-title":"Optimization of the storage location assignment and the picker-routing problem by using mathematical programming","volume":"10","author":"zu\u00f1iga","year":"2020","journal-title":"Appl Sci"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.11648\/j.acm.20170602.15"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2960492"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.4018\/ACIR"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389206"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0973-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-012-9328-0"},{"key":"ref83","first-page":"1","article-title":"A preliminary study on feature-independent hyper-heuristics for the 0\/1 knapsack problem","author":"s\u00e1nchez-d\u00edaz","year":"2020","journal-title":"Proc IEEE Congr Evol Comput (CEC)"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.11.010"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104782"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.09.018"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911846"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1325\/1\/012157"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9383-5"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.5220\/0006497002310238"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1187\/4\/042085"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1462\/1\/012043"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1063\/1.4981999"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45110-2_5"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0475-2"},{"key":"ref87","first-page":"177","author":"burke","year":"2009","journal-title":"Exploring Hyper-heuristic Methodologies with Genetic Programming"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34859-4_32"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09139914.pdf?arnumber=9139914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:56:34Z","timestamp":1667418994000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9139914\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":173,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3009318","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}