{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:57:19Z","timestamp":1760597839074,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030039905"},{"type":"electronic","value":"9783030039912"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03991-2_29","type":"book-chapter","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T14:24:14Z","timestamp":1541773454000},"page":"299-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Diversified Late Acceptance Search"],"prefix":"10.1007","author":[{"given":"Majid","family":"Namazi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Conrad","family":"Sanderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A. Hakim","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Masbaul Alam","family":"Polash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,10]]},"reference":[{"issue":"1","key":"29_CR1","first-page":"192","volume":"10","author":"A Abuhamdah","year":"2010","unstructured":"Abuhamdah, A.: Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems. Int. J. Comput. Sci. Netw. Secur. 10(1), 192\u2013200 (2010)","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-016-2203-7","volume":"242","author":"HM Afsar","year":"2016","unstructured":"Afsar, H.M., Artigues, C., Bourreau, E., Kedad-Sidhoum, S.: Machine reassignment problem: the ROADEF\/EURO challenge 2012. Ann. Oper. Res. 242(1), 1\u201317 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"29_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1093\/comjnl\/3.4.237","volume":"3","author":"J Appleby","year":"1961","unstructured":"Appleby, J., Blake, D., Newman, E.: Techniques for producing school timetables on a computer and their application to other scheduling problems. Comput. J. 3(4), 237\u2013245 (1961)","journal-title":"Comput. J."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Bazargani, M., Lobo, F.G.: Parameter-less late acceptance hill-climbing. In: Genetic and Evolutionary Computation Conference, pp. 219\u2013226 (2017)","DOI":"10.1145\/3071178.3071225"},{"issue":"6","key":"29_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1080\/07408170490438410","volume":"36","author":"E Burke","year":"2004","unstructured":"Burke, E., Bykov, Y., Newall, J., Petrovic, S.: A time-predefined local search approach to exam timetabling problems. IIE Trans. 36(6), 509\u2013528 (2004)","journal-title":"IIE Trans."},{"key":"29_CR6","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for examination timetabling problems. In: Conference on the Practice and Theory of Automated Timetabling (2008)"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70\u201378 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10951-016-0469-x","volume":"19","author":"Y Bykov","year":"2016","unstructured":"Bykov, Y., Petrovic, S.: A step counting hill climbing algorithm applied to university examination timetabling. J. Sched. 19(4), 479\u2013492 (2016)","journal-title":"J. Sched."},{"key":"29_CR9","unstructured":"Curtin, R.R., Bhardwaj, S., Edel, M., Mentekidis, Y.: A generic and fast C++ optimization framework. arXiv 1711.06581 (2017)"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104(1), 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161\u2013175 (1990)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-015-0458-5","volume":"19","author":"GH Fonseca","year":"2016","unstructured":"Fonseca, G.H., Santos, H.G., Carrano, E.G.: Late acceptance hill-climbing for high school timetabling. J. Sched. 19(4), 453\u2013465 (2016)","journal-title":"J. Sched."},{"key":"29_CR13","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam (2004)"},{"issue":"4598","key":"29_CR14","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.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-540-72584-8_71","volume-title":"Computational Science \u2013 ICCS 2007","author":"P McMullan","year":"2007","unstructured":"McMullan, P.: An extended implementation of the great deluge algorithm for course timetabling. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 538\u2013545. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72584-8_71"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Obit, J., Landa-Silva, D., Ouelhadj, D., Sevaux, M.: Non-linear great deluge with learning mechanism for solving the course timetabling problem. In: Metaheuristics International Conference (2009)","DOI":"10.1109\/IS.2008.4670447"},{"key":"29_CR18","unstructured":"Smet, G.D., et al.: OptaPlanner User Guide. Red Hat and the community. http:\/\/www.optaplanner.org"},{"key":"29_CR19","unstructured":"Wauters, T., Toffolo, T., Christiaens, J., Van Malderen, S.: The winning approach for the verolog solver challenge 2014: the swap-body vehicle routing problem. In: Belgian Conference on Operations Research (ORBEL) (2015)"}],"container-title":["Lecture Notes in Computer Science","AI 2018: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03991-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T04:31:13Z","timestamp":1572582673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03991-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030039905","9783030039912"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03991-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wellington","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecs.victoria.ac.nz\/Events\/AI2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}