{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:53:55Z","timestamp":1762005235806,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_5","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"69-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Local Search and Constraint Programming for a Real-World Examination Timetabling Problem"],"prefix":"10.1007","author":[{"given":"Michele","family":"Battistutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-1929","authenticated-orcid":false,"given":"Sara","family":"Ceschia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"De Cesco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-6086","authenticated-orcid":false,"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Topan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10479-015-2061-8","volume":"252","author":"M Battistutta","year":"2015","unstructured":"Battistutta, M., Schaerf, A., Urli, T.: Feature-based tuning of single-stage simulated annealing for examination timetabling. Ann. Oper. Res. 252(2), 239\u2013254 (2015)","journal-title":"Ann. Oper. Res."},{"key":"5_CR2","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.: Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Comput. Oper. Res. 65, 83\u201392 (2016)","journal-title":"Comput. Oper. Res."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-02538-9_13","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"M Birattari","year":"2010","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., St\u00fctzle, T.: F-Race and iterated F-Race: an overview. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 311\u2013336. Springer, Heidelberg (2010)"},{"key":"5_CR4","unstructured":"Bykov, Y., Petrovic, S.: 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 (2013)"},{"key":"5_CR5","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.: Examination timetabling: algorithmic strategies and applications. J. Oper. Res. Soc. 74, 373\u2013383 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"5_CR6","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.: Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Comput. Oper. Res. 39, 1615\u20131624 (2012)","journal-title":"Comput. Oper. Res."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cor.2018.12.015","volume":"104","author":"A Franzin","year":"2019","unstructured":"Franzin, A., St\u00fctzle, T.: Revisiting simulated annealing: a component-based analysis. Comput. Oper. Res. 104, 191\u2013206 (2019)","journal-title":"Comput. Oper. Res."},{"key":"5_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5819-7","volume-title":"Monte Carlo Methods","author":"JM Hammersley","year":"1964","unstructured":"Hammersley, J.M., Handscomb, D.C.: Monte Carlo Methods. Chapman and Hall, London (1964)"},{"key":"5_CR9","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, D., Vecchi, M.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2018.02.009","volume":"94","author":"N Leite","year":"2018","unstructured":"Leite, N., Fernandes, C., Mel\u00edcio, F., Rosa, A.: A cellular memetic algorithm for the examination timetabling problem. Comput. Oper. Res. 94, 118\u2013138 (2018)","journal-title":"Comput. Oper. Res."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.eswa.2018.12.048","volume":"122","author":"N Leite","year":"2019","unstructured":"Leite, N., Mel\u00edcio, F., Rosa, A.: A fast simulated annealing algorithm for the examination timetabling problem. Expert Syst. Appl. 122, 137\u2013151 (2019)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., et al.: Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS J. Comput. 22(1), 120\u2013130 (2010)","journal-title":"INFORMS J. Comput."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and Theory of Automated Timetabling IV","author":"LTG Merlot","year":"2003","unstructured":"Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A hybrid algorithm for the examination timetabling problem. In: Burke, E., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 207\u2013231. Springer, Heidelberg (2003)"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10951-014-0391-z","volume":"19","author":"T M\u00fcller","year":"2014","unstructured":"M\u00fcller, T.: Real-life examination timetabling. J. Sched. 19(3), 257\u2013270 (2014)","journal-title":"J. Sched."},{"issue":"1","key":"5_CR15","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.: A survey of search methodologies and automated system development for examination timetabling. J. Sched. 12(1), 55\u201389 (2009)","journal-title":"J. Sched."},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13(2), 87\u2013127 (1999)","journal-title":"Artif. Intell. Rev."},{"key":"5_CR17","unstructured":"Urli, T.: json2run: a tool for experiment design & analysis. CoRR abs\/1305.1112 (2013)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:07:41Z","timestamp":1600409261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}