{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:32:40Z","timestamp":1786980760494,"version":"build-2736575974"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T00:00:00Z","timestamp":1457049600000},"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-016-2151-2","type":"journal-article","created":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T02:53:20Z","timestamp":1457060000000},"page":"255-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Adaptive large neighborhood search for the curriculum-based course timetabling problem"],"prefix":"10.1007","volume":"252","author":[{"given":"Alexander","family":"Kiefer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Schnell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,4]]},"reference":[{"key":"2151_CR1","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2011.12.018","volume":"191","author":"S Abdullah","year":"2012","unstructured":"Abdullah, S., & Turabieh, H. (2012). On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems. Information Sciences, 191, 146\u2013168.","journal-title":"Information Sciences"},{"issue":"2","key":"2151_CR2","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00291-006-0034-7","volume":"29","author":"S Abdullah","year":"2007","unstructured":"Abdullah, S., Ahmadi, S., Burke, E., & Dror, M. (2007). Investigating Ahuja\u2013Orlin\u2019s large neighbourhood search approach for examination timetabling. OR Spectrum, 29(2), 351\u2013372.","journal-title":"OR Spectrum"},{"issue":"1","key":"2151_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-010-9154-y","volume":"18","author":"S Abdullah","year":"2012","unstructured":"Abdullah, S., Turabieh, H., McCollum, B., & McMullan, P. (2012). A hybrid metaheuristic approach to the university course timetabling problem. Journal of Heuristics, 18(1), 1\u201323.","journal-title":"Journal of Heuristics"},{"issue":"1\u20133","key":"2151_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"K Ahuja","year":"2002","unstructured":"Ahuja, K., & Orlin, J. B. (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1\u20133), 75\u2013102.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"2151_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":"2151_CR6","doi-asserted-by":"publisher","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 and Operations Research, 65, 83\u201392.","DOI":"10.1016\/j.cor.2015.07.002"},{"issue":"2","key":"2151_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., & Toth, P. (2015). An overview of curriculum-based course timetabling. TOP, 23(2), 313\u2013349.","journal-title":"TOP"},{"issue":"1","key":"2151_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","volume":"194","author":"A Bonutti","year":"2012","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2012). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation and results. Annals of Operations Research, 194(1), 59\u201370.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"2151_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22(4), 251\u2013256.","journal-title":"Communications of the ACM"},{"issue":"8","key":"2151_CR10","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1145\/355586.364824","volume":"7","author":"S Broder","year":"1964","unstructured":"Broder, S. (1964). Final examination scheduling. Communications of the ACM, 7(8), 494\u2013498.","journal-title":"Communications of the ACM"},{"issue":"3","key":"2151_CR11","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cor.2009.02.023","volume":"37","author":"EK Burke","year":"2010","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2010). Decomposition, reformulation, and diving in university course timetabling. Computers and Operations Research, 37(3), 582\u2013597.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2151_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","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, 47(3), 373\u2013383.","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"2151_CR13","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1057\/jors.1992.75","volume":"43","author":"D Connolly","year":"1992","unstructured":"Connolly, D. (1992). General purpose simulated annealing. Journal of the Operational Research Society, 43(5), 495\u2013505.","journal-title":"Journal of the Operational Research Society"},{"key":"2151_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-61794-9_66","volume-title":"Practice and theory of automated timetabling. Lecture notes in computer science","author":"TB Cooper","year":"1996","unstructured":"Cooper, T. B., & Kingston, J. H. (1996). The complexity of timetable construction problems. In E. Burke & P. Ross (Eds.), Practice and theory of automated timetabling. Lecture notes in computer science (Vol. 1153, pp. 281\u2013295). Berlin: Springer."},{"issue":"2","key":"2151_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D Werra De","year":"1985","unstructured":"De Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19(2), 151\u2013162.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2151_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., & Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 1(1), 3\u201318.","journal-title":"Swarm and Evolutionary Computation"},{"key":"2151_CR17","unstructured":"Di Gaspero, L., McCollum, B., & Schaerf, A. (2007). The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). Technical report QUB\/IEEE\/Tech\/ITC2007\/CurriculumCTT\/v1.0, Queen\u2019s University, Belfast, UK."},{"issue":"10","key":"2151_CR18","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40(10), 1276\u20131290.","journal-title":"Management Science"},{"issue":"4598","key":"2151_CR19","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. (1983). Optimization by simulated annealing. Science, 220(4598), 671\u2013680.","journal-title":"Science"},{"key":"2151_CR20","unstructured":"Kristiansen, S., & Stidsen, T. (2013). A comprehensive study of educational timetabling\u2014A survey. DTU management engineering report, Department of Management Engineering, Technical University of Denmark."},{"issue":"3","key":"2151_CR21","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10732-013-9219-9","volume":"19","author":"S Kristiansen","year":"2013","unstructured":"Kristiansen, S., S\u00f8rensen, M., Herold, M., & Stidsen, T. (2013). The consultation timetabling problem at danish high schools. Journal of Heuristics, 19(3), 465\u2013495.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"2151_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-010-0700-7","volume":"194","author":"G Lach","year":"2012","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2012). Curriculum based course timetabling: New solutions to Udine benchmark instances. Annals of Operations Research, 194(1), 255\u2013272.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2151_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2008","unstructured":"Lewis, R. (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1), 167\u2013190.","journal-title":"OR Spectrum"},{"issue":"3","key":"2151_CR24","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ejor.2014.07.041","volume":"240","author":"R Lewis","year":"2015","unstructured":"Lewis, R., & Thompson, J. (2015). Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. European Journal of Operational Research, 240(3), 637\u2013648.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2151_CR25","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., & Hao, J. K. (2010). Adaptive tabu search for course timetabling. European Journal of Operational Research, 200(1), 235\u2013244.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2151_CR26","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":"2151_CR27","unstructured":"Muller, L. (2009). An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In MIC 2009: The VIII Metaheuristics international conference."},{"issue":"3","key":"2151_CR28","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ejor.2011.11.036","volume":"218","author":"LF Muller","year":"2012","unstructured":"Muller, L. F., Spoorendonk, S., & Pisinger, D. (2012). A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. European Journal of Operational Research, 218(3), 614\u2013623.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2151_CR29","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). ITC-2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429\u2013446.","journal-title":"Annals of Operations Research"},{"key":"2151_CR30","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis, chapter 45","author":"S Petrovic","year":"2004","unstructured":"Petrovic, S., & Burke, E. (2004). University timetabling. In J. Y. T. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis, chapter 45. Boca Raton: Chapman Hall\/CRC Press."},{"issue":"8","key":"2151_CR31","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers and Operations Research, 34(8), 2403\u20132435.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"2151_CR32","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. K., McCollum, B., Merlot, L., & Lee, S. (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"},{"issue":"4","key":"2151_CR33","doi-asserted-by":"publisher","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. Transportation Science, 40(4), 455\u2013472.","journal-title":"Transportation Science"},{"issue":"2","key":"2151_CR34","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"},{"issue":"2","key":"2151_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159(2), 139\u2013171.","journal-title":"Journal of Computational Physics"},{"key":"2151_CR36","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and practice of constraint programming\u2014CP98. Lecture notes in computer science","author":"P Shaw","year":"1998","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J. F. Puget (Eds.), Principles and practice of constraint programming\u2014CP98. Lecture notes in computer science (Vol. 1520, pp. 417\u2013431). Berlin: Springer."},{"key":"2151_CR37","unstructured":"S\u00f8rensen, M., & Stidsen, T. (2012). High school timetabling: Modeling and solving a large number of cases in denmark. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp. 359\u2013364."},{"key":"2151_CR38","unstructured":"S\u00f8rensen, M., Kristiansen, S., & Stidsen, T. (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."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2151-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2151-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2151-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2151-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:19Z","timestamp":1559138959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2151-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,4]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["2151"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2151-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,4]]}}}