{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:09:41Z","timestamp":1774555781952,"version":"3.50.1"},"reference-count":60,"publisher":"Informa UK Limited","issue":"11","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1080\/01605682.2020.1796538","type":"journal-article","created":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T08:21:35Z","timestamp":1596874895000},"page":"2503-2516","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":25,"title":["Assessing hyper-heuristic performance"],"prefix":"10.1080","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3902-5582","authenticated-orcid":false,"given":"Nelishia","family":"Pillay","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Pretoria, Pretoria, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8318-7509","authenticated-orcid":false,"given":"Rong","family":"Qu","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nottingham, Nottingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,8,7]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-04769-z"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79305-2_4"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-009-0022-y"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.71"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2041061"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_14"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0782-2"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.08.012"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-6775-y"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44691-5_20"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_26"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Chen, P.C., Kendall, G. & Berghe, G. V. (2007). An ant based hyper-heuristic for the travelling tournament problem [Paper presentation]. IEEE symposium on computational intelligence in scheduling (scis \u201907) (p. https:\/\/doi.org\/10.1109\/SCIS.2007.367665)","DOI":"10.1109\/SCIS.2007.367665"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_27"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1108\/K-09-2013-0201"},{"key":"CIT0016","volume-title":"Handbook of metaheuristics","author":"Epitropakis M.","year":"2018"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.14201\/ADCAIJ201541121"},{"key":"CIT0019","volume-title":"Statistics: Fourth international student edition","author":"Freedman D.","year":"2007"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.1.31"},{"key":"CIT0021","first-page":"104","volume-title":"Selected papers from the 3rd international conference on the practice and theory of automated timetabling, Lecture Notes in Computer Science","volume":"2079","author":"Gaspero L. D.","year":"2000"},{"key":"CIT0022","volume":"5","author":"Guantara N.","year":"2018","journal-title":"Electrical and Electronic Engineering"},{"key":"CIT35140796","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.71"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-27744-7_15"},{"key":"CIT0024","volume-title":"Genetic programming: On the programming of computers by means of natural selection","author":"Koza J.","year":"1992","edition":"1"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2016.04.007"},{"key":"CIT0026","doi-asserted-by":"crossref","unstructured":"Lehrbaum, A. (2011). A new hyper-heuristic algorithm for cross-domain search problems [Unpublished master\u2019s thesis]. Faculty of Informatics, Vienna University of Technology.","DOI":"10.1007\/978-3-642-34413-8_41"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.04.043"},{"key":"CIT0028","first-page":"89","volume-title":"Proceedings of the Field-Mitacs Industrial Problems Workshop","author":"Mausser H.","year":"2006"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0320"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-010-9109-y"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-012-0295-8"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.02.006"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0447-4"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2010102603"},{"key":"CIT0036","first-page":"336","volume-title":"Proceedings of the International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010)","author":"Pillay N.","year":"2010"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2011.12"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.18489\/sacj.v48i1.87"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744354"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2625-x"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2008.102"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.10.001"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0077-5"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.5784\/31-1-158"},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"CIT0058","unstructured":"Ross, P., Schulenburg, S., Marin-Blazquez, J. G. & Hart, E. (2002). Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems. In Proceedings of the genetic and evolutionary computation conference (GECCO 2002) (pp. 942\u2013948). Morgan Kaufman Publishers."},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6940-7_20"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281527"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2323936"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-011-0309-9"},{"key":"CIT0051","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(96)00082-2"},{"key":"CIT0052","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463555"},{"key":"CIT0053","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1145\/2908812.2908942","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (Gecco \u201916)","author":"Sim K.","year":"2016"},{"key":"CIT0054","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00121"},{"key":"CIT829810","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-015-9249-1"},{"key":"CIT0055","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0475-2"},{"key":"CIT0056","first-page":"591","volume-title":"Proceedings of the 8th Annual Conference on Genetic Programming and Evolutionary Algorithms","author":"Terashima-Mar\u00edn H.","year":"2006"},{"key":"CIT312059","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.03.021"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01605682.2020.1796538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T20:13:07Z","timestamp":1638303187000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01605682.2020.1796538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,7]]},"references-count":60,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11,2]]}},"alternative-id":["10.1080\/01605682.2020.1796538"],"URL":"https:\/\/doi.org\/10.1080\/01605682.2020.1796538","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,7]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-08-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-28","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-07-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}