{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T05:22:25Z","timestamp":1775366545499,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T00:00:00Z","timestamp":1448236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10479-015-2061-8","type":"journal-article","created":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T05:20:34Z","timestamp":1448256034000},"page":"239-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Feature-based tuning of single-stage simulated annealing for examination timetabling"],"prefix":"10.1007","volume":"252","author":[{"given":"Michele","family":"Battistutta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[]},{"given":"Tommaso","family":"Urli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,23]]},"reference":[{"issue":"1","key":"2061_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D Abramson","year":"1991","unstructured":"Abramson, D. (1991). Constructing school timetables using simulated annealing: Sequential and parallel algorithms. Management Science, 37(1), 98\u2013113.","journal-title":"Management Science"},{"key":"2061_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10951-013-0352-y","volume":"17","author":"M Alzaqebah","year":"2014","unstructured":"Alzaqebah, M., & Abdullah, S. (2014). An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling. Journal of Scheduling, 17, 249\u2013262.","journal-title":"Journal of Scheduling"},{"key":"2061_CR3","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.cor.2014.09.005","volume":"54","author":"M Alzaqebah","year":"2015","unstructured":"Alzaqebah, M., & Abdullah, S. (2015). Hybrid bee colony optimization for examination timetabling problems. Computers and Operations Research, 54, 142\u2013154.","journal-title":"Computers and Operations Research"},{"key":"2061_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2015.07.002","volume":"65","author":"R Bellio","year":"2016","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., Schaerf, A., & Urli, T. (2016). Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Computers & Operations Research, 65, 83\u201392.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2061_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10951-011-0224-2","volume":"15","author":"R Bellio","year":"2012","unstructured":"Bellio, R., Di Gaspero, L., & Schaerf, A. (2012). Design and statistical analysis of a hybrid local search algorithm for course timetabling. Journal of Scheduling, 15(1), 49\u201361.","journal-title":"Journal of Scheduling"},{"key":"2061_CR6","doi-asserted-by":"publisher","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., & St\u00fctzle, T. (2010). F-race and iterated F-race: An overview. In Th. Bartz-Beielstein, M. Chiarandini, M. Paquete, & M. Preuss (Eds.), Experimental methods for the analysis of optimization algorithms (pp. 311\u2013336). Springer: Berlin.","DOI":"10.1007\/978-3-642-02538-9_13"},{"issue":"1","key":"2061_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10479-012-1140-3","volume":"218","author":"EK Burke","year":"2014","unstructured":"Burke, E. K., Qu, R., & Soghier, A. (2014). Adaptive selection of heuristics for improving exam timetables. Annals of Operations Research, 218(1), 129\u2013145.","journal-title":"Annals of Operations Research"},{"key":"2061_CR8","unstructured":"Bykov, Y., & Petrovic, S. (2013). An initial study of a novel step counting hill climbing heuristic applied to timetabling problems. In Proceedings of the 6th multidisciplinary international conference on scheduling: Theory and applications (MISTA-13) (pp. 691\u2013693)."},{"issue":"2","key":"2061_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"MW Carter","year":"1986","unstructured":"Carter, M. W. (1986). A survey of practical applications of examination timetabling algorithms. Operations Research, 34(2), 193\u2013202.","journal-title":"Operations Research"},{"key":"2061_CR10","unstructured":"Carter, M.W., & Laporte, G. (1996). Recent developments in pratical examination timetabling. In Burke, E. K., Ross, P. (Ed.), Proceedings of the 1st international conference on the practice and theory of automated timetabling (ICPTAT-95). Lecture notes in computer science (Vol. 1153, pp. 3\u201321). Berlin: Springer."},{"key":"2061_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"74","author":"MW Carter","year":"1996","unstructured":"Carter, M. W., Laporte, G., & Lee, S. Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of the Operational Research Society, 74, 373\u2013383.","journal-title":"Journal of the Operational Research Society"},{"key":"2061_CR12","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2011.09.014","volume":"39","author":"S Ceschia","year":"2012","unstructured":"Ceschia, S., Di Gaspero, L., & Schaerf, A. (2012). Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers & Operations Research, 39, 1615\u20131624.","journal-title":"Computers & Operations Research"},{"key":"2061_CR13","doi-asserted-by":"publisher","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software-Practice and Experience, 33(8), 733\u2013765.","DOI":"10.1002\/spe.524"},{"issue":"10","key":"2061_CR14","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1057\/jors.1990.143","volume":"41","author":"KA Dowsland","year":"1990","unstructured":"Dowsland, K. A. (1990). A timetabling problem in which clashes are inevitable. Journal of the Operational Research Society, 41(10), 907\u2013918.","journal-title":"Journal of the Operational Research Society"},{"key":"2061_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. London: Kluwer Academic Publishers."},{"issue":"1","key":"2061_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10479-010-0712-3","volume":"194","author":"C Gogos","year":"2012","unstructured":"Gogos, C., Alefragis, P., & Housos, E. (2012). An improved multi-staged algorithmic process for the solution of the examination timetabling problem. Annals of Operations Research, 194(1), 203\u2013221.","journal-title":"Annals of Operations Research"},{"key":"2061_CR17","unstructured":"Gogos, C., Goulas, G., Alefragis, P., Kolonias, V., & Housos, E. (2010). Distributed scatter search for the examination timetabling problem. In Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT-2010) (pp. 211\u2013223)."},{"key":"2061_CR18","unstructured":"Hamilton-Bryce, R., McMullan, P., & McCollum, B. (2013). Directing selection within an extended great deluge optimization algorithm. In Proceedings of the 6th multidisciplinary international conference on scheduling: Theory and applications (MISTA-13) (pp. 499\u2013508)."},{"key":"2061_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1063\/1.3047186","volume":"18","author":"JM Hammersley","year":"1965","unstructured":"Hammersley, J. M., Handscomb, D. C., & Weiss, G. (1965). Monte Carlo methods. Physics Today, 18, 55.","journal-title":"Physics Today"},{"issue":"6","key":"2061_CR20","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"DS Johnson","year":"1989","unstructured":"Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989). Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research, 37(6), 865\u2013892.","journal-title":"Operations Research"},{"key":"2061_CR21","volume-title":"Principal component analysis","author":"I Jolliffe","year":"2005","unstructured":"Jolliffe, I. (2005). Principal component analysis. Hoboken: Wiley Online Library."},{"key":"2061_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754098","volume-title":"Quantile regression","author":"R Koenker","year":"2005","unstructured":"Koenker, R. (2005). Quantile regression. Cambridge: Cambridge University Press."},{"key":"2061_CR23","doi-asserted-by":"publisher","unstructured":"Lopes, L., & Smith-Miles, K. (2010). Pitfalls in instance generation for Udine timetabling. In C. Blum, & R. Battiti (Eds.), Learning and intelligent optimization (LION4) (pp. 299\u2013302). Berlin: Springer.","DOI":"10.1007\/978-3-642-13800-3_31"},{"issue":"1","key":"2061_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1111\/itor.12043","volume":"21","author":"F Mascia","year":"2014","unstructured":"Mascia, F., Pellegrini, P., Birattari, M., & St\u00fctzle, T. (2014). An analysis of parameter adaptation in reactive tabu search. International Transactions in Operational Research, 21(1), 127\u2013152.","journal-title":"International Transactions in Operational Research"},{"key":"2061_CR25","unstructured":"McCollum, B., McMullan, P. J., Parkes, A. J., Burke, E. K., & Abdullah, S. (2009). An extended great deluge approach to the examination timetabling problem. In Proceedings of the 4th multidisciplinary international conference on scheduling: Theory and applications (MISTA-09) (pp. 424\u2013434)."},{"key":"2061_CR26","unstructured":"McCollum, B. (2007). A perspective on bridging the gap in university timetabling. In E. Burke & H. Rudov\u00e1 (Eds.), Proceedings of the 6th international conference on the practice and theory of automated timetabling (PATAT-2006), selected papers. Lecture notes in computer science, (Vol. 3867, pp. 3\u201323). Berlin: Springer."},{"key":"2061_CR27","unstructured":"McCollum, B., McMullan, P., Burke, E. K., Parkes, A. J., & Qu, R. (2007). The second international timetabling competition: Examination timetabling track. Technical report QUB\/IEEE\/Tech\/ITC2007\/Exam\/v4.0\/17, Queen\u2019s University, Belfast (UK), September."},{"issue":"1","key":"2061_CR28","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., et al. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22(1), 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"key":"2061_CR29","doi-asserted-by":"publisher","unstructured":"Merlot, L., Boland, N., Hughes, B., & Stuckey, P. (2003). A hybrid algorithm for the examination timetabling problem. In B. Edmund & C. Patrick\u00a0De (Eds.) Proceedings of the 4th international conference on the practice and theory of automated timetabling (PATAT-2002), selected papers. Lecture notes in computer science (Vol. 2740, pp. 207\u2013231). Berlin: Springer.","DOI":"10.1007\/978-3-540-45157-0_14"},{"issue":"1","key":"2061_CR30","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). ITC2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429\u2013446.","journal-title":"Annals of Operations Research"},{"key":"2061_CR31","doi-asserted-by":"publisher","unstructured":"Nethercote, N., Stuckey, P. J., Becket, R., Brand, S., Duck, G. J., & Tack, G. (2007). MiniZinc: Towards a standard CP modelling language. In C. Bessi\u00e8re (Ed.), Principles and practice of constraint programming CP 2007 (pp. 529\u2013543). Berlin: Springer.","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"2061_CR32","unstructured":"\u00d6zcan, E., Elhag, A., & Shah, V. (2012). A study of hyper-heuristics for examination timetabling. In Proceedings of the 9th international conference on the practice and theory of automated timetabling (PATAT-2012) (pp. 410\u2013414)."},{"key":"2061_CR33","unstructured":"Pillay, N. (2010). Evolving hyper-heuristics for a highly constrained examination timetabling problem. In Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT-2010) (pp. 211\u2013223)."},{"issue":"1","key":"2061_CR34","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R Qu","year":"2009","unstructured":"Qu, R., Burke, E., McCollum, B., Merlot, L., & Lee, S. Y. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), 55\u201389.","journal-title":"Journal of Scheduling"},{"key":"2061_CR35","unstructured":"R Development Core Team (2008). R: A language and environment for statistical computing. Vienna, Austria: R Foundation for Statistical Computing."},{"issue":"2","key":"2061_CR36","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TCYB.2014.2323936","volume":"45","author":"NR Sabar","year":"2014","unstructured":"Sabar, N. R., Ayob, M., Kendall, G., & Qu, R. (2014). A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Transactions on Cybernetics, 45(2), 217\u2013228.","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"2","key":"2061_CR37","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"2061_CR38","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K. A., & Lopes, L. (2011). Generalising algorithm performance in instance space: A timetabling case study. In C. A. Coello Coello (Ed.), Learning and intelligent optimization (LION 2011). Lecture notes in computer science (Vol. 6683, pp. 524\u2013538). Springer: Berlin.","DOI":"10.1007\/978-3-642-25566-3_41"},{"issue":"1","key":"2061_CR39","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"JM Thompson","year":"1996","unstructured":"Thompson, J. M., & Dowsland, K. A. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research, 63(1), 105\u2013128.","journal-title":"Annals of Operations Research"},{"issue":"7","key":"2061_CR40","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"JM Thompson","year":"1998","unstructured":"Thompson, J. M., & Dowsland, K. A. (1998). A robust simulated annealing based examination timetabling system. Computers and Operations Research, 25(7), 637\u2013648.","journal-title":"Computers and Operations Research"},{"key":"2061_CR41","unstructured":"Urli, T. (2013). json2run: A tool for experiment design & analysis. CoRR, \n                        arXiv:abs\/1305.1112\n                        \n                    ."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2061-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2061-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2061-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2061-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:16Z","timestamp":1559138956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2061-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,23]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["2061"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2061-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,23]]}}}