{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:57:14Z","timestamp":1762505834111},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255656"},{"type":"electronic","value":"9783642255663"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25566-3_48","type":"book-chapter","created":{"date-parts":[[2011,11,14]],"date-time":"2011-11-14T04:19:51Z","timestamp":1321244391000},"page":"616-630","source":"Crossref","is-referenced-by-count":21,"title":["Hyperion \u2013 A Recursive Hyper-Heuristic Framework"],"prefix":"10.1007","author":[{"given":"Jerry","family":"Swan","sequence":"first","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","first-page":"225","volume-title":"Industrial Scheduling","author":"H. Fisher","year":"1963","unstructured":"Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225\u2013251. Prentice-Hall, Inc., New Jersey (1963)"},{"key":"48_CR2","series-title":"GSIA","volume-title":"ONR Research Memorandum","author":"W. Crowston","year":"1963","unstructured":"Crowston, W., Glover, F., Thompson, G., Trawick, J.: Probabilistic and parameter learning combinations of local job shop scheduling rules. In: ONR Research Memorandum. GSIA, vol.\u00a0117, Carnegie Mellon University, Pittsburgh (1963)"},{"key":"48_CR3","unstructured":"Denzinger, J., Fuchs, M., Fuchs, M.: High Performance ATP Systems by combining several AI Methods. In: Proceedings of the 4th Asia-Pacific Conference on SEAL, IJCAI, pp. 102\u2013107 (1997)"},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P.I. Cowling","year":"2001","unstructured":"Cowling, P.I., Kendall, G., Soubeiga, E.: A Hyperheuristic approach to Scheduling a Sales Summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"48_CR5","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-01799-5_6","volume-title":"Computational Intelligence","author":"E.K. Burke","year":"2009","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: Exploring Hyper-heuristic Methodologies with Genetic Programming. In: Kacprzyk, J., Jain, L.C., Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence. Intelligent Systems Reference Library, vol.\u00a01, pp. 177\u2013201. Springer, Heidelberg (2009)"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"P. Ross","year":"2005","unstructured":"Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 529\u2013556. Springer, Heidelberg (2005)"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Metaheuristics","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 457\u2013474. Kluwer, Dordrecht (2003)"},{"key":"48_CR8","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Metaheuristics","author":"E.K. Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol.\u00a0146, pp. 449\u2013468. Springer, US (2010)"},{"key":"48_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E. \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal.\u00a012, 3\u201323 (2008)","journal-title":"Intell. Data Anal."},{"key":"48_CR10","volume-title":"Generative Programming: Methods, Tools, and Applications","author":"K. Czarnecki","year":"2000","unstructured":"Czarnecki, K., Eisenecker, U.: Generative Programming: Methods, Tools, and Applications. Addison-Wesley Professional, Reading (2000)"},{"key":"48_CR11","series-title":"OR\/CS Interfaces Series","first-page":"81","volume-title":"Optimization Software Class Libraries","author":"A. Fink","year":"2002","unstructured":"Fink, A., Vo\u00df, S.: Hotframe: A heuristic optimization framework. In: Vo\u00df, S., Woodruff, D. (eds.) Optimization Software Class Libraries. OR\/CS Interfaces Series, pp. 81\u2013154. Kluwer Academic Publishers, Boston (2002)"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L.D. Gaspero","year":"2003","unstructured":"Gaspero, L.D., Schaerf, A.: Easylocal++: An Object-oriented Framework for the flexible design of Local-Search Algorithms. Softw., Pract. Exper.\u00a033, 733\u2013765 (2003)","journal-title":"Softw., Pract. Exper."},{"key":"48_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/3-540-45578-7_58","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"C. Voudouris","year":"2001","unstructured":"Voudouris, C., Dorne, R., Lesaint, D., Liret, A.: iOpt: A Software Toolkit for Heuristic Search Methods. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 716\u2013729. Springer, Heidelberg (2001)"},{"key":"48_CR14","unstructured":"Burke, E.K., Curtois, T., Hyde, M., Kendall, G., Ochoa, G., Petrovic, S., Vazquez-Rodriguez, J.A.: HyFlex: A Flexible Framework for the Design and Analysis of Hyper-heuristics. In: Multidisciplinary International Scheduling Conference (MISTA 2009), Dublin, Ireland, pp. 790\u2013797 (2009)"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Gamma, E., Helm, R., Johnson, R.E., Vlissides, J.M.: Design patterns: Abstraction and reuse of object-oriented design. In: Wang, J. (ed.) ECOOP 1993. LNCS, vol.\u00a0707, pp. 406\u2013431. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-47910-4_21"},{"key":"48_CR16","unstructured":"Ayob, M., Kendall, G.: A monte carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In: Proceedings of the International Conference on Intelligent Technologies (InTech 2003), Chiang Mai, Thailand, pp. 132\u2013141 (2003)"},{"key":"48_CR17","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"48_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/0-387-25383-1_4","volume-title":"Metaheuristics: Progress as Real Problem Solver","author":"R. Bai","year":"2005","unstructured":"Bai, R., Kendall, G.: An investigation of automated planograms using a simulated annealing based hyper-heuristics. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solver, pp. 87\u2013108. Springer, Heidelberg (2005)"},{"key":"48_CR19","first-page":"1","volume":"2","author":"E. Burke","year":"2010","unstructured":"Burke, E., Kendall, G., Misir, M., \u00d6zcan, E.: Monte carlo hyper-heuristics for examination timetabling. Annals of Operations Research\u00a02, 1\u201318 (2010), 10.1007\/s10479-010-0782-2","journal-title":"Annals of Operations Research"},{"key":"48_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics: The great deluge algorithm and the record-to record travel. Journal of Computational Physics\u00a0104, 86\u201392 (1993)","journal-title":"Journal of Computational Physics"},{"key":"48_CR21","volume-title":"Proceedings of the 5th International Conference on Genetic Algorithms","author":"M. Mitchell","year":"1993","unstructured":"Mitchell, M., Holland, J.H.: When will a genetic algorithm outperform hill climbing? In: Proceedings of the 5th International Conference on Genetic Algorithms, vol.\u00a0647. Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"key":"48_CR22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"L.P. Kaelbling","year":"1996","unstructured":"Kaelbling, L.P., Littman, M.L., Moore, A.P.: Reinforcement learning: A survey. J. Artif. Intell. Res. (JAIR)\u00a04, 237\u2013285 (1996)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"48_CR23","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Misir, M., Ochoa, G., Burke, E.: A reinforcement learning - great-deluge hyper-heuristic for examination timetabling. International Journal of Applied Metaheuristic Computing, 39\u201359 (2010)","DOI":"10.4018\/jamc.2010102603"},{"key":"48_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BFb0029751","volume-title":"Parallel Problem Solving from Nature","author":"M. Herdy","year":"1991","unstructured":"Herdy, M.: Application of the evolutionsstrategie to discrete optimization problems. In: Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1990. LNCS, vol.\u00a0496, pp. 188\u2013192. Springer, Heidelberg (1991)"},{"key":"48_CR25","doi-asserted-by":"publisher","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 Journal on Computing\u00a01, 190\u2013206 (1989)","journal-title":"INFORMS Journal on Computing"},{"key":"48_CR26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"48_CR27","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss, J.C., \u00d6zcan, E., Parkes, A.J., Terashima-Marin, H.: Mapping the performance of heuristics for constraint satisfaction, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5585965"},{"key":"48_CR28","unstructured":"Hyde, M., \u00d6zcan, E., Burke, E.K.: Multilevel search for evolving the acceptance criteria of a hyper-heuristic. In: Proceedings of the 4th Multidisciplinary Int. Conf. on Scheduling: Theory and Applications, pp. 798\u2013801 (2009)"},{"key":"48_CR29","unstructured":"Ersoy, E., \u00d6zcan, E., Uyar, C.: Memetic algorithms and hyperhill-climbers. In: Baptiste, P., Kendall, G., Kordon, A.M., Sourd, F. (eds.) 3rd Multidisciplinary Int. Conf. On Scheduling: Theory and Applications, pp. 159\u2013166 (2007)"},{"key":"48_CR30","doi-asserted-by":"crossref","unstructured":"White, S.: Concepts of scale in simulated annealing. In: Proc. Int\u2019l Conf. on Computer Design, pp. 646\u2013651 (1984)","DOI":"10.1063\/1.34823"},{"key":"48_CR31","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An online resource for research on SAT. In: Gent, I.P., Maaren, H.V., Walsh, T. (eds.) SAT 2000 (2000), SATLIB is available online at www.satlib.org"},{"key":"48_CR32","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1162\/evco.1995.3.2.199","volume":"3","author":"D.J. Montana","year":"1995","unstructured":"Montana, D.J.: Strongly typed genetic programming. Evolutionary Computation\u00a03, 199\u2013230 (1995)","journal-title":"Evolutionary Computation"},{"key":"48_CR33","first-page":"1256","volume-title":"GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation","author":"D. Iclanzan","year":"2007","unstructured":"Iclanzan, D., Dumitrescu, D.: Overcoming hierarchical difficulty by hill-climbing the building block structure. In: GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1256\u20131263. ACM, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25566-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T10:08:51Z","timestamp":1560938931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25566-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255656","9783642255663"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25566-3_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}