{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:20:06Z","timestamp":1773415206250,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2013,7,31]],"date-time":"2013-07-31T00:00:00Z","timestamp":1375228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s00500-013-1096-5","type":"journal-article","created":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T09:17:21Z","timestamp":1375175841000},"page":"2279-2292","source":"Crossref","is-referenced-by-count":36,"title":["A greedy gradient-simulated annealing selection hyper-heuristic"],"prefix":"10.1007","volume":"17","author":[{"given":"Murat","family":"Kalender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Kheiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,31]]},"reference":[{"key":"1096_CR1","doi-asserted-by":"crossref","unstructured":"Abramson D (1991) Constructing school timetables using simulated annealing: sequential and parallel algorithms. Manag Sci 37(1):98\u2013113","DOI":"10.1287\/mnsc.37.1.98"},{"key":"1096_CR2","first-page":"1","volume":"16","author":"D Abramson","year":"1999","unstructured":"Abramson D, Dang H, Krisnamoorthy M (1999) Simulated annealing cooling schedules for the school timetabling problem. Asia Pac J Oper Res 16:1\u201322","journal-title":"Asia Pac J Oper Res"},{"key":"1096_CR3","doi-asserted-by":"crossref","unstructured":"Alkan A, \u00d6zcan E (2003) Memetic algorithms for timetabling. In: Congress on evolutionary computation, CEC \u201903, vol 3, pp 1796\u20131802","DOI":"10.1109\/CEC.2003.1299890"},{"key":"1096_CR4","doi-asserted-by":"crossref","unstructured":"Bai R, Kendall G (2005) 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. Springer, Berlin, pp 87\u2013108","DOI":"10.1007\/0-387-25383-1_4"},{"key":"1096_CR5","doi-asserted-by":"crossref","unstructured":"Bai R, Burke E, Gendreau M, Kendall G, McCollum B (2007a) Memory length in hyper-heuristics: An empirical study. In: IEEE symposium on computational intelligence in scheduling, SCIS \u201907, pp 173\u2013178","DOI":"10.1109\/SCIS.2007.367686"},{"key":"1096_CR6","unstructured":"Bai R, Burke EK, Kendall G, McCollum B (2007 b) A simulated annealing hyper-heuristic methodology for flexible decision support. Tech. Rep. NOTTCS-TR-2007-8, School of CSiT, University of Nottingham, UK"},{"key":"1096_CR7","doi-asserted-by":"crossref","unstructured":"Bilgin B, \u00d6zcan E, Korkmaz E (2007) An experimental study on hyper-heuristics and exam timetabling. In: Burke E, Rudovn H (eds) Practice and theory of automated timetabling VI. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, pp 394\u2013412","DOI":"10.1007\/978-3-540-77345-0_25"},{"issue":"1","key":"1096_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10479-010-0782-2","volume":"196","author":"E Burke","year":"2012","unstructured":"Burke E, Kendall G, M\u0131s\u0131r M, \u00d6zcan E (2012) Monte carlo hyper-heuristics for examination timetabling. Ann Oper Res 196(1):73\u201390","journal-title":"Ann Oper Res"},{"issue":"6","key":"1096_CR9","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 (2003) A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9(6):451\u2013470","journal-title":"J Heuristics"},{"issue":"2","key":"1096_CR10","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 (2006) Case-based heuristic selection for timetabling problems. J Sched 9(2):115\u2013132","journal-title":"J Sched"},{"key":"1096_CR11","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Woodward JR (2010) A classification of hyper-heuristics approaches. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. International series in operations research & management Science, chap 15, vol 57, 2nd edn. Springer, pp 449\u2013468","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"1096_CR12","doi-asserted-by":"crossref","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc. doi: 10.1057\/jors.2013.71","DOI":"10.1057\/jors.2013.71"},{"key":"1096_CR13","doi-asserted-by":"crossref","unstructured":"Colorni A, Dorigo M, Maniezzo V (1992) A genetic algorithm to solve the timetable problem. Tech Rep 90\u2013060, Politecnico di Milano, Italy","DOI":"10.1007\/978-3-642-77489-8_14"},{"key":"1096_CR14","doi-asserted-by":"crossref","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A hyperheuristic approach to scheduling a sales summit. In: Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling. Springer, London, pp 176\u2013190","DOI":"10.1007\/3-540-44629-X_11"},{"key":"1096_CR15","doi-asserted-by":"crossref","unstructured":"Crowston WB, Glover F, Thompson GL, Trawick JD (1963) Probabilistic and parametric learning combinations of local job shop scheduling rules. ONR Research memorandum, vol 117. GSIA, Carnegie Mellon University, Pittsburgh","DOI":"10.21236\/AD0600965"},{"issue":"3","key":"1096_CR16","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(96)00111-7","volume":"96","author":"D Werra de","year":"1997","unstructured":"de Werra D (1997) The combinatorics of timetabling. Eur J Oper Res 96(3):504\u2013513","journal-title":"Eur J Oper Res"},{"key":"1096_CR17","doi-asserted-by":"crossref","unstructured":"Di Gaspero L, Urli T (2012) Evaluation of a family of reinforcement learning cross-domain optimization heuristics. In: Hamadi Y, Schoenauer M (eds) Learning and Intelligent Optimization. Lecture Notes in Computer Science. Springer, Berlin, pp 384\u2013389","DOI":"10.1007\/978-3-642-34413-8_32"},{"key":"1096_CR18","unstructured":"Domr\u00f6s J, Homberger J (2012) An evolutionary algorithm for high school timetabling. In: Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp 485\u2013488"},{"key":"1096_CR19","doi-asserted-by":"crossref","unstructured":"Erben W, Keppler J (1996) A genetic algorithm solving a weekly course-timetabling problem. In: Selected papers from the first international conference on practice and theory of automated timetabling. Springer, London, pp 198\u2013211","DOI":"10.1007\/3-540-61794-9_60"},{"issue":"4","key":"1096_CR20","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even S, Itai A, Shamir A (1976) On the complexity of timetable and multicommodity flow problems. SIAM J Comput 5(4):691\u2013703","journal-title":"SIAM J Comput"},{"key":"1096_CR21","doi-asserted-by":"crossref","unstructured":"Filho GR, Antonio L, Lorena LAN (2001) A constructive evolutionary approach to school timetabling. In: Proceedings of the EvoWorkshops on applications of evolutionary computing. Springer, London, pp 130\u2013139","DOI":"10.1007\/3-540-45365-2_14"},{"key":"1096_CR22","first-page":"225","volume-title":"Industrial scheduling","author":"H Fisher","year":"1963","unstructured":"Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial scheduling. Prentice-Hall, Inc., New Jersey, pp 225\u2013251"},{"key":"1096_CR23","unstructured":"Fonseca GHG, Santos HG, Toffolo TAM, Brito SS, Souza MJF (2012) A sa-ils approach for the high school timetabling problem. In: Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp 493\u2013496"},{"issue":"3","key":"1096_CR24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(92)90248-9","volume":"35","author":"A Hertz","year":"1992","unstructured":"Hertz A (1992) Finding a feasible course schedule using tabu search. Discrete Appl Math 35(3):255\u2013270","journal-title":"Discrete Appl Math"},{"key":"1096_CR25","doi-asserted-by":"crossref","unstructured":"Kalender M, Kheiri A, \u00d6zcan E, Burke E (2012) A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem. In: 2012 12th UK workshop on computational intelligence, UKCI 2012","DOI":"10.1109\/UKCI.2012.6335754"},{"key":"1096_CR26","unstructured":"Kheiri A, \u00d6zcan E, Parkes AJ (2012) Hysst: hyper-heuristic search strategies and timetabling. In: Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp 497\u2013499"},{"key":"1096_CR27","doi-asserted-by":"crossref","unstructured":"Lehre P, \u00d6zcan E (2013) A runtime analysis of simple hyper-heuristics: To mix or not to mix operators. In: FOGA 2013\u2014proceedings of the 12th ACM workshop on foundations of genetic algorithms, pp 97\u2013104","DOI":"10.1145\/2460239.2460249"},{"issue":"1","key":"1096_CR28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2007","unstructured":"Lewis R (2007) A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30(1):167\u2013190","journal-title":"OR Spectrum"},{"key":"1096_CR29","doi-asserted-by":"crossref","unstructured":"Lewis R, Paechter B, Rossi-Doria O (2007) Metaheuristics for university course timetabling. In: Dahal K, Tan K, Cowling P (eds) Evolutionary scheduling. Studies in computational intelligence vol. 49. Springer, Berlin, pp 237\u2013272","DOI":"10.1007\/978-3-540-48584-1_9"},{"key":"1096_CR30","doi-asserted-by":"crossref","unstructured":"McCollum B, Schaerf A, Paechter B, McMullan P, Lewis R, Parkes AJ, Gaspero LD, Qu R, Burke EK (2010) Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS J Comput 22(1):120\u2013130","DOI":"10.1287\/ijoc.1090.0320"},{"key":"1096_CR31","first-page":"523","volume-title":"Metaheuristics: computer desicion-making","author":"A Nareyek","year":"2004","unstructured":"Nareyek A (2004) Choosing search heuristics by non-stationary reinforcement learning. In: Resende MGC, de Sousa JP, Viana A (eds) Metaheuristics: computer desicion-making. Kluwer Academic Publishers, Norwell, pp 523\u2013544"},{"key":"1096_CR32","doi-asserted-by":"crossref","unstructured":"Ochoa G, Hyde M, Curtois T, Vazquez-Rodriguez J, Walker J, Gendreau M, Kendall G, McCollum B, Parkes A, Petrovic S, Burke E (2012) Hyflex: a benchmark framework for cross-domain heuristic search. In: Hao JK, Middendorf M (eds) European conference on evolutionary computation in combinatorial optimisation, EvoCOP \u201912. LNCS, vol 7245. Springer, Heidelberg, pp 136\u2013147","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"1096_CR33","unstructured":"\u00d6zcan E, Ersoy E (2005) Final exam scheduler\u2014 fes. In: The 2005 IEEE congress on evolutionary computation, vol 2, pp 1356\u20131363"},{"key":"1096_CR34","unstructured":"\u00d6zcan E, Kheiri A (2012) A hyper-heuristic based on random gradient, greedy and dominance. In: Gelenbe E, Lent R, Sakellari G (eds) Computer and information sciences II. Springer, London, pp 557\u2013563"},{"key":"1096_CR35","doi-asserted-by":"crossref","unstructured":"\u00d6zcan E, Bilgin B, Korkmaz EE (2006) Hill climbers and mutational heuristics in hyperheuristics. In: Runarsson TP, Beyer HG, Burke E, Merelo-Guerv\u2019s JJ, Whitley LD, Yao X (eds) Parallel problem solving from nature\u2014PPSN IX. Lecture notes in computer science, vol 4193. Springer, Berlin, pp 202\u2013211","DOI":"10.1007\/11844297_21"},{"issue":"1","key":"1096_CR36","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 EE (2008) A comprehensive analysis of hyper-heuristics. Intelligent data analysis 12(1):3\u201323","journal-title":"Intelligent data analysis"},{"issue":"10","key":"1096_CR37","doi-asserted-by":"crossref","first-page":"2310","DOI":"10.1016\/j.cor.2011.11.020","volume":"39","author":"E \u00d6zcan","year":"2012","unstructured":"\u00d6zcan E, Parkes AJ, Alkan A (2012) The interleaved constructive memetic algorithm and its application to timetabling. Comput Oper Res 39(10):2310\u20132322","journal-title":"Comput Oper Res"},{"key":"1096_CR38","doi-asserted-by":"crossref","unstructured":"Paechter B, Rankin R, Cumming A, Fogarty T (1998) Timetabling the classes of an entire university with an evolutionary algorithm. In: Eiben A, B\u00e4ck T, Schoenauer M, Schwefel HP (eds) Parallel problem solving from nature n++ PPSN V. Lecture notes in computer science, vol 1498. Springer, Berlin, pp 865\u2013874","DOI":"10.1007\/BFb0056928"},{"key":"1096_CR39","unstructured":"Post G, Gaspero LD, Kingston JH, McCollum B, Schaerf A (2012) The third international timetabling competition. In: Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp 479\u2013484"},{"key":"1096_CR40","unstructured":"Schaerf A (1996) Tabu search techniques for large high-school timetabling problems. In: Proceedings of the thirteenth national conference on artificial intelligence, AAAI \u201996. AAAI Press, USA, pp 363\u2013368"},{"key":"1096_CR41","doi-asserted-by":"crossref","unstructured":"Socha K, Knowles J, Sampels M (2002) A max-min ant system for the university course timetabling problem. In: Proceedings of the third international workshop on ant algorithms, ANTS \u201902, Springer, London, pp 1\u201313","DOI":"10.1007\/3-540-45724-0_1"},{"key":"1096_CR42","unstructured":"S\u00f8rensen M, Kristiansen S, Stidsen TR (2012) International timetabling competition 2011: an adaptive large neighborhood search algorithm. In: Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp 489\u2013492"},{"key":"1096_CR43","doi-asserted-by":"crossref","unstructured":"Swan J, \u00d6zcan E, Kendall G (2011) Hyperion\u2014a recursive hyper-heuristic framework. In: Coello CAC (ed) LION. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, pp 616\u2013630","DOI":"10.1007\/978-3-642-25566-3_48"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1096-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1096-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1096-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T20:41:46Z","timestamp":1563568906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1096-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,31]]},"references-count":43,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["1096"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1096-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,31]]}}}