{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T04:18:35Z","timestamp":1774153115363,"version":"3.50.1"},"reference-count":78,"publisher":"MIT Press - Journals","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolutionary Computation"],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p> Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the current solution to produce a new solution at each point in the search. The use of crossover low-level heuristics is possible in an increasing number of general-purpose hyper-heuristic tools such as HyFlex and Hyperion. However, little work has been undertaken to assess how best to utilise it. Since a single-point search hyper-heuristic operates on a single candidate solution, and two candidate solutions are required for crossover, a mechanism is required to control the choice of the other solution. The frameworks we propose maintain a list of potential solutions for use in crossover. We investigate the use of such lists at two conceptual levels. First, crossover is controlled at the hyper-heuristic level where no problem-specific information is required. Second, it is controlled at the problem domain level where problem-specific information is used to produce good-quality solutions to use in crossover. A number of selection hyper-heuristics are compared using these frameworks over three benchmark libraries with varying properties for an NP-hard optimisation problem: the multidimensional 0-1 knapsack problem. It is shown that allowing crossover to be managed at the domain level outperforms managing crossover at the hyper-heuristic level in this problem domain. <\/jats:p>","DOI":"10.1162\/evco_a_00145","type":"journal-article","created":{"date-parts":[[2015,1,30]],"date-time":"2015-01-30T14:55:46Z","timestamp":1422629746000},"page":"113-141","source":"Crossref","is-referenced-by-count":43,"title":["A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem"],"prefix":"10.1162","volume":"24","author":[{"given":"John H.","family":"Drake","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham, NG8 1BB, UK"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham, NG8 1BB, UK"}]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[{"name":"Computing Science and Mathematics, School of Natural Sciences, University of Stirling, Stirling, FK9 4LA, Scotland"}]}],"member":"281","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.02.002"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-011-0182-8"},{"key":"B3","author":"Battiti R.","year":"2008","journal-title":"Reactive search and intelligent optimization"},{"key":"B4","first-page":"394","volume":"3867","author":"Bilgin B.","year":"2006","journal-title":"Proceedings of the International Conference on the Practice and Theory of Automated Timetabling (PATAT 2006)"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.08.007"},{"key":"B6","volume-title":"Proceedings of the International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008)","author":"Burke E. K.","year":"2008"},{"key":"B7","first-page":"790","volume-title":"Proceedings of the Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2009)","author":"Burke E. K.","year":"2009"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_16"},{"key":"B9","first-page":"64:1695","author":"Burke E. K.","year":"2013","journal-title":"Journal of the Operational Research Society"},{"key":"B10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-642-01799-5_6","author":"Burke E. K.","year":"2009","journal-title":"Computational intelligence: Collaboration, fusion and emeregense"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0782-2"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.08.012"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31996-2_3"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79438-7_1"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31996-2_4"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2011.5949773"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6492-1_55"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44629-X_11"},{"key":"B22","first-page":"127","volume-title":"Proceedings of the Metaheuristics International Conference (MIC 2001)","author":"Cowling P.","year":"2001"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.013"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0258-5"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37207-0_3"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_31"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87700-4_18"},{"key":"B29","author":"Fisher M.","year":"1961","journal-title":"Proceedings of the Factory Scheduling Conference"},{"key":"B30","first-page":"109","author":"Forrest S.","year":"1992","journal-title":"Proceedings of Foundations of Genetic Algorithms (FOGA 1992)"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90209-7"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.12.005"},{"key":"B33","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey M. R.","year":"1979"},{"key":"B35","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"Goldberg D. E","year":"1989"},{"key":"B36","doi-asserted-by":"publisher","DOI":"10.1007\/10721187_2"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16054-7_9"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0546-z"},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71618-1_40"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1994.350050"},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.1126\/science.275.5296.51"},{"key":"B42","author":"Hyde M.","year":"2010","journal-title":"A genetic programming hyper-heuristic approach to automated packing"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.1109\/UKCI.2013.6651310"},{"key":"B45","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.02.019"},{"key":"B46","first-page":"73","author":"Jones T.","year":"1995","journal-title":"Proceedings of the International Conference on Genetic Algorithms (ICGA 1995)"},{"key":"B47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37198-1_1"},{"key":"B48","doi-asserted-by":"publisher","DOI":"10.1145\/326619.326694"},{"key":"B49","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.24"},{"key":"B50","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"B51","volume-title":"Genetic programming: On the programming of computers by means of natural selection","author":"Koza J. R","year":"1992"},{"key":"B52","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90286-8"},{"key":"B53","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1306-7","author":"Maniezzo V.","year":"2010","journal-title":"Matheuristics: Hybridizing metaheuristics and mathematical programming"},{"key":"B54","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0460"},{"key":"B55","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9125-3"},{"key":"B56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_45"},{"key":"B57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39930-8_3"},{"key":"B58","first-page":"523","author":"Nareyek A.","year":"2001","journal-title":"Metaheuristics: Computer decision-making"},{"key":"B59","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"B61","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.856143"},{"key":"B62","first-page":"231","volume-title":"Proceedings of the 25th Benelux Artificial Intelligence Conference","author":"Onsem W. V.","year":"2013"},{"key":"B63","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-008-0354-4"},{"key":"B64","first-page":"202","volume":"4193","author":"\u00d6zcan E.","year":"2006","journal-title":"Proceedings of Parallel Problem Solving from Nature (PPSN 2006)"},{"key":"B65","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2008-12102"},{"key":"B66","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4983054"},{"key":"B67","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A"},{"key":"B68","doi-asserted-by":"publisher","DOI":"10.1007\/11730095_17"},{"issue":"4","key":"B69","first-page":"320","volume":"16","author":"Qian F.","year":"2007","journal-title":"Numerical Mathematics"},{"key":"B70","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699502"},{"key":"B71","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666886"},{"key":"B72","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78295-7_2"},{"key":"B73","first-page":"339","volume":"7298","author":"Rendl A.","year":"2012","journal-title":"Proceedings of Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2012)"},{"key":"B74","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28356-0_17"},{"key":"B75","volume-title":"Reinforcement learning: An introduction","author":"Sutton R.","year":"1998"},{"key":"B76","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_48"},{"key":"B77","first-page":"2","volume-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","author":"Syswerda G","year":"1989"},{"key":"B78","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.915539"},{"key":"B79","first-page":"328","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2001)","author":"Vasquez M.","year":"2001"},{"key":"B80","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.01.024"},{"key":"B81","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9074-4"},{"key":"B82","doi-asserted-by":"publisher","DOI":"10.1287\/opre.15.1.83"}],"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/EVCO_a_00145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:58:37Z","timestamp":1615586317000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/24\/1\/113-141\/1008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":78,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1162\/EVCO_a_00145"],"URL":"https:\/\/doi.org\/10.1162\/evco_a_00145","relation":{},"ISSN":["1063-6560","1530-9304"],"issn-type":[{"value":"1063-6560","type":"print"},{"value":"1530-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}