{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:14:51Z","timestamp":1772820891429,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,23]],"date-time":"2011-11-23T00:00:00Z","timestamp":1322006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s10288-011-0182-8","type":"journal-article","created":{"date-parts":[[2011,11,22]],"date-time":"2011-11-22T08:34:05Z","timestamp":1321950845000},"page":"43-66","source":"Crossref","is-referenced-by-count":56,"title":["A simulated annealing hyper-heuristic methodology for flexible decision support"],"prefix":"10.1007","volume":"10","author":[{"given":"Ruibin","family":"Bai","sequence":"first","affiliation":[]},{"given":"Jacek","family":"Blazewicz","sequence":"additional","affiliation":[]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]},{"given":"Barry","family":"McCollum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,23]]},"reference":[{"key":"182_CR1","first-page":"153","volume-title":"Metaheuristics\u2014progress in complex systems optimization","author":"S Abdullah","year":"2007","unstructured":"Abdullah S, Burke EK, McCollum B (2007) Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr G, Hartl RF, Reimann M (eds) Metaheuristics\u2014progress in complex systems optimization. Springer, New York, pp 153\u2013169"},{"key":"182_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"ACF Alvim","year":"2004","unstructured":"Alvim ACF, Ribeiro CC, Glover F, Aloise DJ (2004) A hybrid improvement heuristic for the one-dimensional bin packing problem. J Heuristics 10: 205\u2013229","journal-title":"J Heuristics"},{"key":"182_CR3","unstructured":"Asmuni H, Burke EK, Garibaldi JM (2005) Fuzzy multiple heuristic ordering for course timetabling. In: Proceedings of the 5th United Kingdom workshop on computational intelligence (UKCI05), London, UK, pp 302\u2013309"},{"key":"182_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/0-387-25383-1_4","volume-title":"Metaheuristics: progress as real problem solver\u2014(Operations research\/computer science interface series, vol 32)","author":"R Bai","year":"2005","unstructured":"Bai R, Kendall G (2005) An investigation of automated planograms using a simulated annealing based hyper-heuristic. In: Ibaraki T, Nonobe K, Yagiura M (eds) Metaheuristics: progress as real problem solver\u2014(Operations research\/computer science interface series, vol 32). Springer, New York, pp 87\u2013108"},{"issue":"1","key":"182_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G Belov","year":"2006","unstructured":"Belov G, Scheithauer G (2006) A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur J Oper Res 171(1): 85\u2013106","journal-title":"Eur J Oper Res"},{"key":"182_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-28356-0","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"EK Burke","year":"2005","unstructured":"Burke EK, Kendall G (2005) Search methodologies: introductory tutorials in optimization and decision support techniques. Kluwer, Dordrecht"},{"issue":"2","key":"182_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2298\/YJOR0302139B","volume":"13","author":"EK Burke","year":"2003","unstructured":"Burke EK, Bykov Y, Newall J P, Petrovic S (2003a) A time-predefined approach to course timetabling. Yugosl J Oper Res 13(2): 139\u2013151","journal-title":"Yugosl J Oper Res"},{"key":"182_CR8","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 (2003b) A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9: 451\u2013470","journal-title":"J Heuristics"},{"issue":"2","key":"182_CR9","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"},{"issue":"1","key":"182_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for timetabling problems. Eur J Oper Res 176(1): 177\u2013192","journal-title":"Eur J Oper Res"},{"key":"182_CR11","first-page":"449","volume-title":"Handbook of metaheursistics","author":"EK Burke","year":"2009","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, Ozcan E, Woodward JR (2009) A classification of hyper- heuristic approaches. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheursistics. Springer, New York, pp 449\u2013468"},{"issue":"6","key":"182_CR12","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TEVC.2010.2041061","volume":"14","author":"EK Burke","year":"2010","unstructured":"Burke EK, Hyde M, Kendall G, Woodward JR (2010) A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Trans Evol Comput 14(6): 942\u2013958","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"182_CR13","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M Chiarandini","year":"2006","unstructured":"Chiarandini M, Birattari M, Socha K, Rossi-Doria O (2006) An effective hybrid algorithm for university course timetabling. J Sched 9(5): 403\u2013432","journal-title":"J Sched"},{"key":"182_CR14","unstructured":"Chiarandini M, Stutzle T (2003) A landscape analysis for a hybrid approximate algorithm on a timetabling problem. TU Darmstadt Technical Report, AIDA-03-05"},{"key":"182_CR15","volume-title":"Practical nonparametric statistics","author":"WJ Conover","year":"1999","unstructured":"Conover WJ (1999) Practical nonparametric statistics, 3rd edn. Wiley, New York","edition":"3"},{"key":"182_CR16","doi-asserted-by":"crossref","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A hyperheuristic approach to scheduling a sales summit. In: Burke EK, Erben W (eds) Selected papers of the 3rd international conference on the practice and theory of automated timetabling, Lecture Notes in computer science series, vol 2079. Springer, pp 176\u2013190","DOI":"10.1007\/3-540-44629-X_11"},{"key":"182_CR17","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, GSIA, Carnegie Mellon University, Pittsburgh, p 117","DOI":"10.21236\/AD0600965"},{"issue":"3","key":"182_CR18","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"KA Dowsland","year":"2006","unstructured":"Dowsland KA, Soubeiga E, Burke EK (2006) A simulated annealing hyper-heuristic for determining shipper sizes. Eur J Oper Res 179(3): 759\u2013774","journal-title":"Eur J Oper Res"},{"key":"182_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2: 5\u201330","journal-title":"J Heuristics"},{"key":"182_CR20","volume-title":"Genetic algorithms and grouping problems","author":"E Falkenauer","year":"1998","unstructured":"Falkenauer E (1998) Genetic algorithms and grouping problems. Wiley, New York"},{"key":"182_CR21","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, Englewood Cliffs, NJ, pp 225\u2013251"},{"issue":"7","key":"182_CR22","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K Fleszar","year":"2002","unstructured":"Fleszar K, Hindi KS (2002) New heuristics for one-dimensional bin-packing. Comput Oper Res 29(7): 821\u2013839","journal-title":"Comput Oper Res"},{"key":"182_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of metaheuristics","author":"F Glover","year":"2003","unstructured":"Glover F, Kochenberger G (2003) Handbook of metaheuristics. Kluwer, Dordrecht"},{"key":"182_CR24","doi-asserted-by":"crossref","unstructured":"Han L, Kendall G (2003) Guided operators for a hyper-heuristic genetic algorithm. In: AI 2003: advances in artificial intelligence: the proceedings of 16th Australian conference on AI. Lecture notes in computer science, vol 2903. Springer, pp 807\u2013820","DOI":"10.1007\/978-3-540-24581-0_69"},{"key":"182_CR25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mladenovic N, Moreno Perez JA (2008) Variable neighbourhood search: methods and applications. 4OR-A Q J Oper Res 6: 319\u2013360","journal-title":"4OR-A Q J Oper Res"},{"issue":"1","key":"182_CR26","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1162\/evco.1998.6.1.61","volume":"6","author":"E Hart","year":"1998","unstructured":"Hart E, Ross P, Nelson JA (1998) Solving a real-world problem using an evolving heuristically driven schedule builder. Evol Comput 6(1): 61\u201380","journal-title":"Evol Comput"},{"key":"182_CR27","first-page":"461","volume":"4","author":"H Kitano","year":"1990","unstructured":"Kitano H (1990) Designing neural networks using genetic algorithms with graph generation system. Complex Syst 4: 461\u2013476","journal-title":"Complex Syst"},{"key":"182_CR28","unstructured":"Kostuch P (2004) The university course timetabling problem with a 3-phase approach. In: Burke EK, Trick M (eds) The practice and theory of automated timetabling V, Lecture notes in computer science, vol 3616. Springer, Berlin, pp 109\u2013125"},{"key":"182_CR29","first-page":"321","volume-title":"Handbook of metaheuristics","author":"HR Lourenco","year":"2003","unstructured":"Lourenco HR, Martin OC, Stutzle T (2003) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 321\u2013354"},{"key":"182_CR30","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M Lundy","year":"1986","unstructured":"Lundy M, Mees A (1986) Convergence of an annealing algorithm. Math Program 34: 111\u2013124","journal-title":"Math Program"},{"key":"182_CR31","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York"},{"key":"182_CR32","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Lower pounds and reduction procedures for the bin packing problem. Discret Appl Math 28: 59\u201370","journal-title":"Discret Appl Math"},{"key":"182_CR33","first-page":"538","volume-title":"An extended implementation of the Great Deluge Algorithm for course timetabling. Lecture notes in computer science, vol 4487","author":"P McMullan","year":"2007","unstructured":"McMullan P (2007) An extended implementation of the Great Deluge Algorithm for course timetabling. Lecture notes in computer science, vol 4487. Springer, Berlin, pp 538\u2013545"},{"key":"182_CR34","unstructured":"Metaheuristic Network (2003) International timetabling competition: Competition results http:\/\/www.idsia.ch\/Files\/ttcomp2002\/results.htm . Accessed 11 October 2010"},{"key":"182_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0909-0","volume-title":"Bayesian approach to global optimization","author":"J Mockus","year":"1989","unstructured":"Mockus J (1989) Bayesian approach to global optimization. Kluwer, Dordrecht"},{"issue":"4","key":"182_CR36","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01099263","volume":"4","author":"J Mockus","year":"1994","unstructured":"Mockus J (1994) Application of bayesian approach to numerical methods of global and stochastic optimization. J Glob Optim 4(4): 347\u2013366","journal-title":"J Glob Optim"},{"key":"182_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2627-5","volume-title":"Bayesian heuristic approach to discrete and global optimization","author":"J Mockus","year":"1997","unstructured":"Mockus J (1997) Bayesian heuristic approach to discrete and global optimization. Kluwer, Dordrecht"},{"key":"182_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4671-9","volume-title":"A set of examples of global and discrete optimization: application of bayesian heuristic approach","author":"J Mockus","year":"2000","unstructured":"Mockus J (2000) A set of examples of global and discrete optimization: application of bayesian heuristic approach. Kluwer, Dordrecht"},{"key":"182_CR39","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-1-4757-4137-7_25","volume-title":"Metaheuristics: computer decision-making","author":"A Nareyek","year":"2003","unstructured":"Nareyek A (2003) Choosing search heuristics by non-stationary reinforcement learning. In: Resende MGC, de Sousa JP (eds) Metaheuristics: computer decision-making. Kluwer, Dordrecht, pp 523\u2013544"},{"key":"182_CR40","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1057\/jors.2008.102","volume":"60","author":"R Qu","year":"2009","unstructured":"Qu R, Burke EK (2009) Hybridisations within a graph based hyper-heuristic framework for university timetabling problems. J Oper Res Soc 60: 1273\u20131285","journal-title":"J Oper Res Soc"},{"key":"182_CR41","first-page":"51","volume-title":"Selected papers from the 5th international conference on the practice and theory of automated timetabling. Lecture notes in computer science series, vol 3616","author":"P Rattadilok","year":"2005","unstructured":"Rattadilok P, Gaw A, Kwan RSK (2005) Distributed choice function hyper-heuristics for timetabling and scheduling. In: Burke EK, Trick M (eds) Selected papers from the 5th international conference on the practice and theory of automated timetabling. Lecture notes in computer science series, vol 3616. Springer, Berlin, pp 51\u201370"},{"issue":"4","key":"182_CR42","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4): 455\u2013472","journal-title":"Transp Sci"},{"key":"182_CR43","doi-asserted-by":"crossref","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 (2005) Hyper-heuristics. In: Burke EK, Kendall G (eds) Search methodologies: introductory tutorials in optimization and decision support techniques. Springer, Berlin, pp 529\u2013556"},{"key":"182_CR44","doi-asserted-by":"crossref","unstructured":"Ross P, Marin-Blazquez JG, Schulenburg S, Hart E (2003) Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics. In: Proceeding of the genetic and evolutionary computation conference, GECCO 2003. Springer, Berlin, pp 1295\u20131306","DOI":"10.1007\/3-540-45110-2_5"},{"key":"182_CR45","unstructured":"Rossi-Doria O, Blum C, Knowles J, Samples M, Socha K, Paechter B (2002) A local search for automated timetabling. In: Proceedings of the 4th international conference on the practice and theory of automated timetabling [PATAT 2002] (pp 124\u2013127)"},{"issue":"3","key":"182_CR46","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3): 344\u2013354","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"182_CR47","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl A, Klein R, Jurgens C (1997) BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput Oper Res 24(7): 627\u2013645","journal-title":"Comput Oper Res"},{"issue":"5\/6","key":"182_CR48","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1111\/j.1475-3995.1997.tb00093.x","volume":"4","author":"P Schwerin","year":"1997","unstructured":"Schwerin P, Wascher G (1997) The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. Int Trans Oper Res 4(5\/6): 377\u2013389","journal-title":"Int Trans Oper Res"},{"key":"182_CR49","doi-asserted-by":"crossref","unstructured":"Socha K, Knowles J, Samples M (2002) A max-min ant system for the university course timetabling problem. In: Proceedings of the 3rd international workshop on ant algorithm, ANTS 2002. Lecture notes in computer science, vol 2463, pp 1\u201313","DOI":"10.1007\/3-540-45724-0_1"},{"key":"182_CR50","unstructured":"Soubeiga E (2003) Development and application of hyperheuristics to personnel scheduling. PhD Thesis, The University of Nottingham, UK"},{"key":"182_CR51","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning: an introduction. MIT Press, Cambridge, MA"},{"key":"182_CR52","unstructured":"Terashima-Marin H, Ross P, Valenzuela-Rendon M (1999) Evolution of constraint satisfaction strategies in examination timetabling. In: Proceedings of the genetic and evolutionary computation conference, GECCO 1999. Morgan Kaufmann, Los Altos, CA, pp 635\u2013642"},{"issue":"4","key":"182_CR53","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1109\/TEVC.2005.846817","volume":"9","author":"S Venkatraman","year":"2005","unstructured":"Venkatraman S, Yen GG (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4): 424\u2013435","journal-title":"IEEE Trans Evol Comput"},{"key":"182_CR54","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G Waescher","year":"1996","unstructured":"Waescher G, Gau T (1996) Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18: 131\u2013144","journal-title":"OR Spektrum"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0182-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-011-0182-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0182-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T19:04:50Z","timestamp":1560971090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-011-0182-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,23]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["182"],"URL":"https:\/\/doi.org\/10.1007\/s10288-011-0182-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,23]]}}}