{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:20:14Z","timestamp":1760646014169,"version":"3.40.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,17]],"date-time":"2013-02-17T00:00:00Z","timestamp":1361059200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s12559-013-9201-8","type":"journal-article","created":{"date-parts":[[2013,2,16]],"date-time":"2013-02-16T05:32:17Z","timestamp":1360992737000},"page":"66-73","source":"Crossref","is-referenced-by-count":33,"title":["Searching the Hyper-heuristic Design Space"],"prefix":"10.1007","volume":"6","author":[{"given":"Jerry","family":"Swan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Woodward","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund","family":"Burke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,17]]},"reference":[{"issue":"3","key":"9201_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s12559-012-9164-1","volume":"4","author":"JM Bishop","year":"2012","unstructured":"Bishop JM, Erden YJ. Computational creativity, intelligence and autonomy. Cognit Comput. 2012;4(3):209\u20131.","journal-title":"Cognitive Computation"},{"issue":"3","key":"9201_CR2","first-page":"294","volume":"11","author":"G Kendall","year":"2007","unstructured":"Kendall G, Su Y. Imperfect evolutionary systems, Evolutionary Computation. IEEE Trans. 2007;11(3):294\u20137 doi: 10.1109\/TEVC.2006.887348 .","journal-title":"IEEE Transactions on"},{"issue":"3","key":"9201_CR3","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/s12559-012-9152-5","volume":"4","author":"M d\u2019Inverno","year":"2012","unstructured":"d\u2019Inverno M, Luck M. Creativity through autonomy and interaction. Cognit Comput. 2012;4(3):332\u201346.","journal-title":"Cognitive Computation"},{"key":"9201_CR4","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, Ozcan E, Woodward JR. A classification of hyper-heuristics approaches. In: Gendreau M, Potvin J-Y, editors. Handbook of metaheuristics, 2nd Edition, vol 57 of international series in operations research & management science. Berlin:Springer; 2010. Ch. 15, p. 449\u201368.","DOI":"10.1007\/978-1-4419-1665-5_15"},{"issue":"3","key":"9201_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0004-3702(85)90063-3","volume":"26","author":"B Hayes-Roth","year":"1985","unstructured":"Hayes-Roth B. A blackboard architecture for control. Artif Intell. 1985;26(3):251\u201321.","journal-title":"Artif Intell"},{"key":"9201_CR6","unstructured":"Denzinger J, Fuchs M, Fuchs M. High performance ATP systems by combining several AI methods, Tech. rep., University of Kaiserslautern 1997."},{"key":"9201_CR7","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Soubeiga E . A tabu-search hyperheuristic for timetabling and rostering. J Heuristics. 2003;9(6):451\u201370.","journal-title":"J Heuristics"},{"key":"9201_CR8","doi-asserted-by":"crossref","unstructured":"Rattadilok P, Gaw A, Kwan RK. Distributed choice function hyper-heuristics for timetabling and scheduling. In: Burke E, Trick M, editors. Practice and theory of automated timetabling, vol. 3616 of Lecture Notes in Computer Science. Springer: Berlin; 2005. p. 51\u201367.","DOI":"10.1007\/11593577_4"},{"key":"9201_CR9","doi-asserted-by":"crossref","unstructured":"Cowling P, Chekhlevitch K. Hyperheuristics for managing a large collection of low-level heuristics to schedule personnel. In: The 2003 congress on evolutionary computation (CEC \u201803), vol. 2; 2003. p. 1214\u201321.","DOI":"10.1109\/CEC.2003.1299807"},{"key":"9201_CR10","unstructured":"Woodward J, Parkes A, Ochoa G. A mathematical formalization of hyper-heuristics, Presented to the \u2019Workshop on Hyper-Heuristics\u2019 at 10th international conference on parallel problem solving from nature (PPSN-08), Technische University Dortmund, Germany. (September 2008)."},{"key":"9201_CR11","unstructured":"Peyton Jones S, et\u00a0al. The Haskell 98 language and libraries: the revised report. J Funct Program. 2003;13(1):0\u2013255 http:\/\/www.haskell.org\/definition\/"},{"issue":"2","key":"9201_CR12","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti R, Tecchiolli G. The reactive tabu search. INFORMS J Comput 1994;6(2):126\u201340.","journal-title":"INFORMS Journal on Computing"},{"key":"9201_CR13","unstructured":"Spinellis D. Another level of indirection. In: Oram A, Wilson G editors. Beautiful code: leading programmers explain how they think. Sebastopol: O\u2019Reilly and Associates; 2007. Ch. 17, p. 279\u201391."},{"key":"9201_CR14","doi-asserted-by":"crossref","unstructured":"Swan J, \u00d6zcan E, Kendall G. Hyperion - a recursive hyper-heuristic framework. In: Coello C editors. Learning and intelligent optimization, Vol. 6683 of Lecture Notes in Computer Science. Springer: Berlin; 2011. p. 616\u201330.","DOI":"10.1007\/978-3-642-25566-3_48"},{"issue":"3","key":"9201_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F. Tabu search-Part I. INFORMS J Comput 1989;1(3):190\u2013206","journal-title":"INFORMS Journal on Computing"},{"key":"9201_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling LP, Littman ML, Moore AW. Reinforcement learning: a survey. J Artif Intell Res (JAIR) 1996;4:237\u201385.","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"1","key":"9201_CR17","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F. Tabu search-Part II. INFORMS J Comput 1990;2(1):4\u201332.","journal-title":"INFORMS Journal on Computing"},{"key":"9201_CR18","doi-asserted-by":"crossref","unstructured":"Eiben AE, Ruttkay Z. Self-adaptivity for constraint satisfaction: learning penalty functions In: International conference on evolutionary computation. 1996, p. 258\u201361.","DOI":"10.1109\/ICEC.1996.542371"},{"key":"9201_CR19","unstructured":"Mar\u00edn-Bl\u00e1zquez JG, Schulenburg S. A hyper-heuristic framework with xcs: learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients. In: IWLCS, 2005, p. 193\u2013218."},{"issue":"2","key":"9201_CR20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"EK Burke","year":"2006","unstructured":"Burke EK, Petrovic S, Qu R. Case-based heuristic selection for timetabling problems. J Sched. 2006;9(2):115\u201332.","journal-title":"J. Scheduling"},{"key":"9201_CR21","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde MR, Kendall G, Ochoa G, Ozcan E, Woodward JR. Exploring hyper-heuristic methodologies with genetic programming. In: Mumford CL, Jain LC editors. Computational intelligence, Vol. 1 of intelligent systems reference library. Berlin:Springer; 2009. Ch. 6, p. 177\u2013201.","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"9201_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"PF Stadler","year":"1996","unstructured":"Stadler PF. Landscapes and their correlation functions. J Math Chem. 1996;20:1\u201345. doi: 10.1007\/BF01165154 .","journal-title":"J Math Chem"},{"key":"9201_CR23","first-page":"77","volume-title":"Complex systems and binary networks, Vol. 461 of lecture notes in physics","author":"PF Stadler","year":"1995","unstructured":"Stadler PF. Towards a theory of landscapes. In: Lpez-Pena R, Capovilla R, Garca-Pelayo R, Waelbroeck H, Zertuche F editors. Complex systems and binary networks, Vol. 461 of Lecture notes in physics. Berlin: Springer; 1995. p. 77\u2013163."},{"issue":"4","key":"9201_CR24","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1162\/evco.1996.4.4.335","volume":"4","author":"W Hordijk","year":"1997","unstructured":"Hordijk W. A measure of landscapes. Evol Comput 1997;4(4):335\u201360.","journal-title":"Evolutionary Computation"},{"key":"9201_CR25","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"CR Reeves","year":"1999","unstructured":"Reeves CR. Landscapes, operators and heuristic search. Ann Oper Res 1999;86:473\u201390.","journal-title":"Ann Oper Res"},{"key":"9201_CR26","doi-asserted-by":"crossref","unstructured":"Reeves CR. Fitness landscapes and evolutionary algorithms. In: AE \u201999: selected papers from the 4th European conference on artificial evolution. London: Springer; 2000. p. 3\u201320.","DOI":"10.1007\/10721187_1"},{"key":"9201_CR27","first-page":"175","volume-title":"Properties of fitness functions and search landscapes","author":"L Kallel","year":"2001","unstructured":"Kallel L, Naudts B, Reeves CR. Properties of fitness functions and search landscapes. London: Springer; 2001. p. 175\u2013206."},{"issue":"5","key":"9201_CR28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E Weinberger","year":"1990","unstructured":"Weinberger E. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybern 1990;63(5):325\u201336.","journal-title":"Biol Cybern"},{"key":"9201_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-3711-7","volume-title":"Bandit problems: sequential allocation of experiments","author":"DA Berry","year":"1985","unstructured":"Berry DA, Fristedt B. Bandit problems: sequential allocation of experiments. Berlin: Springer; 1985."},{"key":"9201_CR30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00962824","volume":"4","author":"S Dzeroski","year":"1995","unstructured":"Dzeroski S, Todorovski L. Discovering dynamics: From inductive logic programming to machine discovery. J Intell Inf Syst 1995;4:89\u2013108 doi: 10.1007\/BF00962824 .","journal-title":"J Intell Inf Syst"},{"issue":"2","key":"9201_CR31","first-page":"925","volume":"34","author":"M Milano","year":"2004","unstructured":"Milano M, Roli A. Magma: a multiagent architecture for metaheuristics, systems, man, and cybernetics, part B: cybernetics. IEEE Trans. 2004;34(2):925\u2013941 doi: 10.1109\/TSMCB.2003.818432 .","journal-title":"IEEE Trans"},{"key":"9201_CR32","doi-asserted-by":"crossref","unstructured":"Ouelhadj D, Petrovic S. A cooperative hyper-heuristic search framework. J Heuristics 2009;1\u201323 doi: 10.1007\/s10732-009-9122-6 .","DOI":"10.1007\/s10732-009-9122-6"},{"key":"9201_CR33","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0004-3702(91)90053-M","volume":"47","author":"R Brooks","year":"1991","unstructured":"Brooks R. Intelligence without representation. Artif Intell 1991;47:139\u201359.","journal-title":"Artif Intell"},{"key":"9201_CR34","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of metaheuristics, Vol. 57 of international series in operations research and management science","author":"E Burke","year":"2003","unstructured":"Burke E, Kendall G, Newall J, Hart E, Ross P, Schulenburg S. Hyper-heuristics: an emerging direction in modern search technology. In: Glover F, Kochenberger G, Hillier FS, editors. Handbook of Metaheuristics, Vol. 57 of international series in operations research and management science. New York: Springer; 2003. p. 457\u201374."},{"key":"9201_CR35","doi-asserted-by":"crossref","unstructured":"Booch G, Maksimchuk RA, Engle MW, Young BJ, Connallen J, Houston KA. Object-oriented analysis and design with applications, third edition, ACM SIGSOFT software engineering notes 33(5).","DOI":"10.1145\/1402521.1413138"},{"key":"9201_CR36","unstructured":"Carver N, Lesser V. The evolution of blackboard control architectures, Tech. rep., Amherst, USA; 1992."},{"issue":"3","key":"9201_CR37","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/s12559-012-9130-y","volume":"4","author":"MM al Rifaie","year":"2012","unstructured":"al Rifaie MM, Bishop JM, Caines S. Creativity and autonomy in swarm intelligence systems. Cognit Comput 2012;4(3):320\u201331.","journal-title":"Cognit Comput"},{"key":"9201_CR38","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing. Science 1983;220:671\u201380.","journal-title":"Science"},{"key":"9201_CR39","doi-asserted-by":"crossref","unstructured":"White S. Concepts of scale in simulated annealing. In: Proceedings of international conference on computer design; 1984, p. 646\u201351.","DOI":"10.1063\/1.34823"},{"key":"9201_CR40","unstructured":"Hoos HH, St\u00fctzle T. SATLIB: An online resource for research on SAT. In: Gent IP, Maaren Hv, Walsh T, editors. SAT 2000, SATLIB is available online at http:\/\/www.satlib.org 2000."},{"issue":"1","key":"9201_CR41","first-page":"565","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu L, Hutter F, Hoos HH, Leyton-Brown K. Satzilla: portfolio-based algorithm selection for sat. J Artif Int Res 2008;32(1):565\u2013606.","journal-title":"J Artif Int Res"},{"issue":"8","key":"9201_CR42","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"LD Gaspero","year":"2003","unstructured":"Gaspero LD, Schaerf A. Easylocal++: an object-oriented framework for the flexible design of local-search algorithms. Softw Pract Exper 2003;33(8):733\u2013765.","journal-title":"Softw Pract Exper"},{"key":"9201_CR43","unstructured":"Jones T, Forrest S. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the sixth international conference on genetic algorithms. Morgan Kaufmann; 1995. p. 184\u201392."},{"key":"9201_CR44","unstructured":"Birattari M, St\u00fctzle T, Paquete L, Varrentrapp K. A racing algorithm for configuring metaheuristics. In: Proceedings of the genetic and evolutionary computation conference, GECCO \u201902. San Francisco :Morgan Kaufmann Publishers Inc.; 2002. p. 11\u201318."}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-013-9201-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12559-013-9201-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-013-9201-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:28:49Z","timestamp":1745962129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12559-013-9201-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,17]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9201"],"URL":"https:\/\/doi.org\/10.1007\/s12559-013-9201-8","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"type":"print","value":"1866-9956"},{"type":"electronic","value":"1866-9964"}],"subject":[],"published":{"date-parts":[[2013,2,17]]}}}