{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:45:20Z","timestamp":1760708720224},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,22]],"date-time":"2014-06-22T00:00:00Z","timestamp":1403395200000},"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":[[2016,4]]},"DOI":"10.1007\/s10479-014-1660-0","type":"journal-article","created":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T16:26:04Z","timestamp":1403367964000},"page":"135-151","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A stochastic local search algorithm with adaptive acceptance for high-school timetabling"],"prefix":"10.1007","volume":"239","author":[{"given":"Ahmed","family":"Kheiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Parkes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,22]]},"reference":[{"issue":"1","key":"1660_CR1","doi-asserted-by":"crossref","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":"1660_CR2","doi-asserted-by":"crossref","unstructured":"Abramson, D., & Dang, H. (1993). School timetables: A case study in simulated annealing. In Applied simulated annealing, lecture notes in economics and mathematical systems (Vol. 396, pp. 103\u2013124). Berlin: Springer.","DOI":"10.1007\/978-3-642-46787-5_6"},{"key":"1660_CR3","first-page":"1","volume":"16","author":"D Abramson","year":"1999","unstructured":"Abramson, D., Dang, H., & Krisnamoorthy, M. (1999). Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research, 16, 1\u201322.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"4","key":"1660_CR4","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1016\/j.cor.2006.08.010","volume":"35","author":"GN Beligiannis","year":"2008","unstructured":"Beligiannis, G. N., Moschopoulos, C. N., Kaperonis, G. P., & Likothanassis, S. D. (2008). Applying evolutionary computation to the school timetabling problem: The greek case. Computers & Operations Research, 35(4), 1265\u20131280.","journal-title":"Computers & Operations Research"},{"key":"1660_CR5","unstructured":"Bello, G. S., Rangel, M. C., & Boeres, M. C. S. (2008). An approach for the class\/teacher timetabling problem. In PATAT \u201908 proceedings of the 7th international conference on the practice and theory of automated timetabling."},{"issue":"2","key":"1660_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10951-008-0088-2","volume":"12","author":"T Birbas","year":"2009","unstructured":"Birbas, T., Daskalaki, S., & Housos, E. (2009). School timetabling for quality student and teacher schedules. Journal of Scheduling, 12(2), 177\u2013197.","journal-title":"Journal of Scheduling"},{"issue":"8","key":"1660_CR7","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/355586.364824","volume":"7","author":"S Broder","year":"1964","unstructured":"Broder, S. (1964). Final examination scheduling. Communication of the ACM, 7(8), 494\u2013498.","journal-title":"Communication of the ACM"},{"key":"1660_CR8","unstructured":"Burke, E. K., Landa-Silva, J. D., & Soubeiga, E. (2005). Meta-heuristics: Progress as real problem solvers, chap. In Multi-objective hyper-heuristic approaches for space allocation and timetabling (pp. 129\u2013158). Berlin: Springer."},{"key":"1660_CR9","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Curtois, T., Hyde, M. R., Kendall, G., Ochoa, G., Petrovic, S., Rodr\u00edguez, J. A. V., & Gendreau, M. (2010a). Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms. In IEEE congress on evolutionary computation (pp. 1\u20138).","DOI":"10.1109\/CEC.2010.5586064"},{"key":"1660_CR10","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., & Woodward, J. R. (2010b). A classification of hyper-heuristics approaches. In M. Gendreau, & J. Y. Potvin (Eds.), Handbook of metaheuristics, international series in operations research & management science (2nd edn., Vol. 57, pp. 449\u2013468). Berlin: Springer, chap 15.","DOI":"10.1007\/978-1-4419-1665-5_15"},{"issue":"12","key":"1660_CR11","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695\u20131724.","journal-title":"Journal of the Operational Research Society"},{"key":"1660_CR12","doi-asserted-by":"crossref","unstructured":"Chakhlevitch, K., & Cowling, P. (2005). Choosing the fittest subset of low level heuristics in a hyperheuristic framework. In Proceedings of 5th European conference on evolutionary computation in combinatorial optimization (EvoCOP2005), lecture notes in computer science (Vol. 3448, pp. 25\u201333). Berlin: Springer.","DOI":"10.1007\/978-3-540-31996-2_3"},{"key":"1660_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","volume-title":"Adaptive and multilevel metaheuristics, studies in computational intelligence","author":"K Chakhlevitch","year":"2008","unstructured":"Chakhlevitch, K., & Cowling, P. (2008). Hyperheuristics: Recent developments. In C. Cotta, M. Sevaux, & K. Srensen (Eds.), Adaptive and multilevel metaheuristics, studies in computational intelligence (Vol. 136, pp. 3\u201329). Berlin: Springer."},{"key":"1660_CR14","unstructured":"Colorni, A., Dorigo, M., & Maniezzo, V. (1992). A genetic algorithm to solve the timetable problem. Technical report. Technical Report No. 90-060, Politecnico di Milano, Italy."},{"key":"1660_CR15","doi-asserted-by":"crossref","unstructured":"Corne, D., Ross, P., & Fang, H. L. (1994). Fast practical evolutionary timetabling. In Selected papers from AISB workshop on evolutionary computing (pp. 250\u2013263). London: Springer.","DOI":"10.1007\/3-540-58483-8_19"},{"key":"1660_CR16","doi-asserted-by":"crossref","unstructured":"Cowling, P., & Chakhlevitch, K. (2003). Hyperheuristics for managing a large collection of low level heuristics to schedule personnel. In Proceedings of the 2003 congress on evolutionary computation (pp. 1214\u20131221).","DOI":"10.1109\/CEC.2003.1299807"},{"key":"1660_CR17","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2001). A hyperheuristic approach to scheduling a sales summit. In Selected papers from the third international conference on practice and theory of automated timetabling (pp. 176\u2013190). London: Springer.","DOI":"10.1007\/3-540-44629-X_11"},{"issue":"3","key":"1660_CR18","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(96)00111-7","volume":"96","author":"D Werra de","year":"1997","unstructured":"de Werra, D. (1997). The combinatorics of timetabling. European Journal of Operational Research, 96(3), 504\u2013513.","journal-title":"European Journal of Operational Research"},{"key":"1660_CR19","doi-asserted-by":"crossref","unstructured":"Erben, W., & Keppler, J. (1996). A genetic algorithm solving a weekly course-timetabling problem. In E. Burke & P. Ross (Eds.), Practice and theory of automated timetabling, lecture notes in computer science (Vol. 1153, pp. 198\u2013211). Berlin: Springer.","DOI":"10.1007\/3-540-61794-9_60"},{"issue":"4","key":"1660_CR20","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., & Shamir, A. (1976). On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 5(4), 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"key":"1660_CR21","doi-asserted-by":"crossref","unstructured":"Filho, G. R., Antonio, L., & Lorena, L. A. N. (2001). A constructive evolutionary approach to school timetabling. In Applications of evolutionary computing lecture (pp. 130\u2013139). Berlin: Springer.","DOI":"10.1007\/3-540-45365-2_14"},{"key":"1660_CR22","first-page":"225","volume-title":"Industrial scheduling","author":"H Fisher","year":"1963","unstructured":"Fisher, H., & Thompson, G. L. (1963). Probabilistic learning combinations of local job-shop scheduling rules. In J. F. Muth & G. L. Thompson (Eds.), Industrial scheduling (pp. 225\u2013251). New Jersey: Prentice-Hall Inc."},{"key":"1660_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(92)90248-9","volume":"35","author":"A Hertz","year":"1992","unstructured":"Hertz, A. (1992). Finding a feasible course schedule using a tabu search. Discrete Applied Mathematics, 35, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"1660_CR24","unstructured":"Jacobsen, F., Bortfeldt, A., & Gehring, H. (2006). Timetabling at German secondary schools: Tabu search versus constraint Programming. In: Proceedings 6th international conference on the practice and theory of automated timetabling, PATAT2006 (pp. 439\u2013442)."},{"issue":"5","key":"1660_CR25","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/inte.1120.0643","volume":"42","author":"A Kannan","year":"2012","unstructured":"Kannan, A., van den Berg, G., & Kuo, A. (2012). Schedule to personalize learning. Interfaces, 42(5), 437\u2013448.","journal-title":"Interfaces"},{"key":"1660_CR26","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., & Selman, B. (2002). Dynamic restart policies. In Eighteenth national conference on artificial intelligence (pp. 674\u2013681). American Association for Artificial Intelligence: Menlo Park, CA."},{"key":"1660_CR27","doi-asserted-by":"crossref","unstructured":"Kendall, G., & Mohamad, M. (2004). Channel assignment optimisation using a hyper-heuristic. In Proceedings of the 2004 IEEE conference on cybernetic and intelligent systems (CIS2004), Singapore (pp. 790\u2013795).","DOI":"10.1109\/ICCIS.2004.1460689"},{"key":"1660_CR28","doi-asserted-by":"crossref","unstructured":"Kingston, J. (2005). A tiling algorithm for high school timetabling. In E. Burke & M. Trick (Eds.), Practice and theory of automated timetabling V, lecture notes in computer science (Vol. 3616, pp. 208\u2013225). Berlin: Springer.","DOI":"10.1007\/11593577_13"},{"key":"1660_CR29","first-page":"363","volume-title":"Handbook of metaheuristics, international series in operations research and management science","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H. R., Martin, O. C., & St\u00fctzle, T. (2010). Iterated local search: Framework and applications. In M. Gendreau & J. Y. Potvin (Eds.), Handbook of metaheuristics, international series in operations research and management science (Vol. 146, pp. 363\u2013397). Berlin: Springer."},{"issue":"4","key":"1660_CR30","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., & Zuckerman, D. (1993). Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47(4), 173\u2013180.","journal-title":"Information Processing Letters"},{"key":"1660_CR31","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10479-007-0218-9","volume":"155","author":"M Marte","year":"2007","unstructured":"Marte, M. (2007). Towards constraint-based school timetabling. Annals of Operations Research, 155, 207\u2013225.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"1660_CR32","doi-asserted-by":"crossref","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":"1660_CR33","doi-asserted-by":"crossref","unstructured":"Moura, A. V., & Scaraficci, R. A. (2010). A GRASP strategy for a more constrained school timetabling problem. International Journal of Operational Research, 7, 152\u2013170.","DOI":"10.1504\/IJOR.2010.030801"},{"key":"1660_CR34","unstructured":"Mustafa, M. (2012). Intelligent hyperheuristics: A tool for solving generic optimisation problems. PhD thesis. Belgium: Department of Computer Science, KU Leuven."},{"key":"1660_CR35","first-page":"557","volume-title":"ISCIS","author":"E \u00d6zcan","year":"2011","unstructured":"\u00d6zcan, E., & Kheiri, A. (2011). A hyper-heuristic based on random gradient, greedy and dominance. In E. Gelenbe, R. Lent, & G. Sakellari (Eds.), ISCIS (pp. 557\u2013563). Berlin: Springer."},{"issue":"1","key":"1660_CR36","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B., & Korkmaz, E. E. (2008). A comprehensive analysis of hyper-heuristics. Intelligent Data Analysis, 12(1), 3\u201323.","journal-title":"Intelligent Data Analysis"},{"key":"1660_CR37","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Bykov, Y., Birben, M., & Burke, E. (2009). Examination timetabling using late acceptance hyper-heuristics. In Evolutionary computation, 2009. CEC \u201909. IEEE Congress on (pp. 997\u20131004).","DOI":"10.1109\/CEC.2009.4983054"},{"issue":"10","key":"1660_CR38","doi-asserted-by":"crossref","first-page":"2310","DOI":"10.1016\/j.cor.2011.11.020","volume":"39","author":"E \u00d6zcan","year":"2012","unstructured":"\u00d6zcan, E., Parkes, A. J., & Alkan, A. (2012). The interleaved constructive memetic algorithm and its application to timetabling. Computers & Operations Research, 39(10), 2310\u20132322.","journal-title":"Computers & Operations Research"},{"key":"1660_CR39","unstructured":"Pillay, N. (2010a). An overview of school timetabling research. In Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT 2010) (pp. 321\u2013335)."},{"key":"1660_CR40","doi-asserted-by":"crossref","unstructured":"Pillay, N. (2010b). A study into the use of hyper-heuristics to solve the school timetabling problem. In Proceedings of the 2010 annual research conference of the South African institute of computer scientists and information technologists, ACM, New York, NY, USA, SAICSIT \u201910 (pp. 258\u2013264).","DOI":"10.1145\/1899503.1899532"},{"key":"1660_CR41","unstructured":"Pillay, N. (2012). Hyper-heuristics for educational timetabling. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012)."},{"key":"1660_CR42","doi-asserted-by":"crossref","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, 2403\u20132435.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"1660_CR43","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10479-010-0699-9","volume":"194","author":"G Post","year":"2012","unstructured":"Post, G., Ahmadi, S., Daskalaki, S., Kingston, J. H., Kyngas, J., Nurmi, C., et al. (2012). An XML format for benchmarks in high school timetabling. Annals of Operations Research, 194(1), 385\u2013397.","journal-title":"Annals of Operations Research"},{"key":"1660_CR44","unstructured":"Post, G., Gaspero, L. D., Kingston, J. H., McCollum, B., & Schaerf, A. (2012). The third international timetabling competition. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012)."},{"key":"1660_CR45","doi-asserted-by":"crossref","unstructured":"Raghavjee, R., & Pillay, N. (2008). An application of genetic algorithms to the school timetabling problem. In Proceedings of the 2008 annual research conference of the South African Institute of computer scientists and information technologists on IT research in developing countries: Riding the wave of technology, ACM, New York, NY, USA, SAICSIT \u201908 (pp. 193\u2013199).","DOI":"10.1145\/1456659.1456682"},{"key":"1660_CR46","doi-asserted-by":"crossref","unstructured":"Raghavjee, R., & Pillay, N. (2010). Using genetic algorithms to solve the South African school timetabling problem. In Second world congress on nature & biologically inspired computing, NaBIC 2010, 15\u201317 December 2010 (pp. 286\u2013292). Kitakyushu: IEEE.","DOI":"10.1109\/NABIC.2010.5716348"},{"key":"1660_CR47","doi-asserted-by":"crossref","unstructured":"Ross, P. (2005). Hyper-heuristics. In E. K. Burke, & G. Kendall (Eds.) Search methodologies: Introductory tutorials in optimization and decision support techniques (pp. 529\u2013556). Berlin: Springer, chap 17.","DOI":"10.1007\/0-387-28356-0_17"},{"key":"1660_CR48","doi-asserted-by":"crossref","unstructured":"Ross, P., Corne, D., & Fang, H. L. (1994). Improving evolutionary timetabling with delta evaluation and directed mutation. In Y. Davidor, H. P. Schwefel, & R. M\u00e4nner (Eds.), Parallel problem solving from nature, PPSN III, lecture notes in computer science (Vol. 866, pp. 556\u2013565). Berlin: Springer.","DOI":"10.1007\/3-540-58484-6_298"},{"key":"1660_CR49","unstructured":"Schaerf, A. (1996). Tabu search techniques for large high-school timetabling problems. In Proceedings of the thirteenth national conference on Artificial intelligence\u2014volume 1, AAAI Press, AAAI\u201996 (pp 363\u2013368)."},{"issue":"2","key":"1660_CR50","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0360-8352(02)00180-8","volume":"44","author":"KA Smith","year":"2003","unstructured":"Smith, K. A., Abramson, D., & Duke, D. (2003). Hopfield neural networks for timetabling: formulations, methods, and comparative results. Computers & Industrial Engineering, 44(2), 283\u2013305.","journal-title":"Computers & Industrial Engineering"},{"issue":"10","key":"1660_CR51","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1016\/S0305-0548(02)00083-7","volume":"30","author":"C Valouxis","year":"2003","unstructured":"Valouxis, C., & Housos, E. (2003). Constraint programming approach for school timetabling. Computers and Operations Research, 30(10), 1555\u20131572.","journal-title":"Computers and Operations Research"},{"key":"1660_CR52","doi-asserted-by":"crossref","unstructured":"Wilke, P., Gr\u00f6bner, M., & Oster, N. (2002). A hybrid genetic algorithm for school timetabling. In Proceedings of the 15th Australian joint conference on artificial intelligence: Advances in artificial intelligence. Springer: London, AI \u201902 (pp. 455\u2013464).","DOI":"10.1007\/3-540-36187-1_40"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1660-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1660-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1660-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T16:18:10Z","timestamp":1565540290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1660-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,22]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1660"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1660-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,22]]}}}