{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:20:04Z","timestamp":1725873604391},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319470535"},{"type":"electronic","value":"9783319470542"}],"license":[{"start":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T00:00:00Z","timestamp":1481328000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-47054-2_45","type":"book-chapter","created":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T04:14:00Z","timestamp":1481256840000},"page":"687-700","source":"Crossref","is-referenced-by-count":4,"title":["Iterated VND Versus Hyper-heuristics: Effective and General Approaches to Course Timetabling"],"prefix":"10.1007","author":[{"given":"Jorge A.","family":"Soria-Alcaraz","sequence":"first","affiliation":[]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[]},{"given":"Marco A.","family":"Sotelo-Figueroa","sequence":"additional","affiliation":[]},{"given":"Mart\u00edn","family":"Carpio","sequence":"additional","affiliation":[]},{"given":"Hector","family":"Puga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"unstructured":"URL http:\/\/www.cs.qub.ac.uk\/itc2007\/","key":"45_CR1"},{"doi-asserted-by":"crossref","unstructured":"Boizumault, P., Delon, Y., Peridy, L.: Logic programming for examination timetabling. Logic Program 26, 217\u2013233 (1996)","key":"45_CR2","DOI":"10.1016\/0743-1066(95)00100-X"},{"doi-asserted-by":"crossref","unstructured":"Burke, E., Eckersley, A., McCollum, B., Petrovic, S., Qu, R.: Hybrid variable neighborhood approaches to university exam timetabling. European Journal of Operational Research 206(1), 46 \u2013 53 (2010)","key":"45_CR3","DOI":"10.1016\/j.ejor.2010.01.044"},{"doi-asserted-by":"crossref","unstructured":"Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: Hyper- heuristics: a survey of the state of the art. Journal of the Operational Research Society (JORS) 64(12), 1695\u20131724 (2013)","key":"45_CR4","DOI":"10.1057\/jors.2013.71"},{"doi-asserted-by":"crossref","unstructured":"Cambazard, H., Hebrard, E., OSullivan, B., Papadopoulos, A.: Local search and constraint programming for the post enrolment-based course timetabling problem. Annals of Operations Research 194, 111\u2013135 (2012)","key":"45_CR5","DOI":"10.1007\/s10479-010-0737-7"},{"doi-asserted-by":"crossref","unstructured":"Carter, M.: A survey of practical applications of examination timetabling algorithms. Operations Research 34, 193\u2013202 (1986)","key":"45_CR6","DOI":"10.1287\/opre.34.2.193"},{"doi-asserted-by":"crossref","unstructured":"Causmaecker, P.D., Demeester, P., Berghe, G.V.: A decomposed metaheuristic approachfor a real-world university timetabling problem. European Journal of Operational Research 195(1), 307 \u2013 318 (2009)","key":"45_CR7","DOI":"10.1016\/j.ejor.2008.01.043"},{"unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for high-school timetabling. Computational Optimization and Applications 9, 277\u2013298 (1997)","key":"45_CR8"},{"doi-asserted-by":"crossref","unstructured":"Conant-Pablos, S.E., Magaa-Lozano, D.J., Terashima-Marin, H.: Pipelining memetic algorithms, constraint satisfaction, and local search for course timetabling. MICAI Mexican international conference on artificial intelligence 1, 408\u2013419 (2009)","key":"45_CR9","DOI":"10.1007\/978-3-642-05258-3_36"},{"doi-asserted-by":"crossref","unstructured":"Cooper, T.B., Kingston, J.H.: The complexity of timetable construction problems. Ph.D. thesis, The University of Sydney (1995)","key":"45_CR10","DOI":"10.1007\/3-540-61794-9_66"},{"doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies, pp. 211\u2013238. Springer US (2005)","key":"45_CR11","DOI":"10.1007\/0-387-28356-0_8"},{"doi-asserted-by":"crossref","unstructured":"Jarboui, B., Damak, N., Siarry, P., Rebai, A.: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Applied Mathematics and Computation 195(1), 299 \u2013 308 (2008)","key":"45_CR12","DOI":"10.1016\/j.amc.2007.04.096"},{"doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G., Hillier, F.S. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 57, pp. 320\u2013353. Springer New York (2003)","key":"45_CR13","DOI":"10.1007\/0-306-48056-5_11"},{"doi-asserted-by":"crossref","unstructured":"Lajos, G.: Complete university modular timetabling using constraint logic programming. In E Burke and P Ross editors. Practice and Theory of Automated Timetabling (PATAT) I 1153, 146\u2013161 (1996)","key":"45_CR14","DOI":"10.1007\/3-540-61794-9_57"},{"doi-asserted-by":"crossref","unstructured":"Lewis, R.: Metaheuristics for university course timetabling. Ph.D. thesis, University of Nottingham. (August 2006)","key":"45_CR15","DOI":"10.1007\/978-3-540-48584-1_9"},{"doi-asserted-by":"crossref","unstructured":"L, Z., Hao, J.K.: Adaptive tabu search for course timetabling. European Journal of Operational Research 200(1), 235 \u2013 244 (2010)","key":"45_CR16","DOI":"10.1016\/j.ejor.2008.12.007"},{"unstructured":"Mayer, A., Nothegger, C., Chwatal, A., Raidl, G.: Solving the post enrolment course timetabling problem by ant colony optimization. International Timetabling Competition 2007 (2008)","key":"45_CR17"},{"doi-asserted-by":"crossref","unstructured":"Qu, R., Burke, E.K., McCollum, B.: Adaptive automated construction of hybrid heuristics for exam timetabling and graph coloring problems. European Journal of Operational Research 198(2), 392 \u2013 404 (2009)","key":"45_CR18","DOI":"10.1016\/j.ejor.2008.10.001"},{"doi-asserted-by":"crossref","unstructured":"Rudova, H., Muller, T., Murray, K.: Complex university course timetabling. Journal of Scheduling 14, 187\u2013207 (2011).","key":"45_CR19","DOI":"10.1007\/s10951-010-0171-3"},{"doi-asserted-by":"crossref","unstructured":"Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: A honey-bee mating optimization algorithm for educational timetabling problems. European Journal of Operational Research 216(3), 533 \u2013 543 (2012)","key":"45_CR20","DOI":"10.1016\/j.ejor.2011.08.006"},{"doi-asserted-by":"crossref","unstructured":"Schaerf, A. & Gaspero, L.Burke, E. K. & Rudov\u00e1, H. (Eds.)Practice and Theory of Automated Timetabling VI: 6th International Conference, PATAT 2006 Brno, Czech Republic, August 30\u2013September 1, 2006 Revised Selected Papers Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals Springer Berlin Heidelberg, 2007, 40-49","key":"45_CR21","DOI":"10.1007\/978-3-540-77345-0_3"},{"unstructured":"Soria-Alcaraz, J.A., Terashima-Marin, H., Carpio, M.: Academic timetabling design using hyper-heuristics. Advances in Soft Computing, ITT Springer-Verlag 1, 158\u2013164 (2010)","key":"45_CR22"},{"doi-asserted-by":"crossref","unstructured":"Soria-Alcaraz, J.A., Ochoa, G., Swan, J., Carpio, M., Puga, H., Burke, E.K.: Effective learning hyper-heuristics for the course timetabling problem. European Journal of Operational Research 238(1), 77 \u2013 86 (2014).","key":"45_CR23","DOI":"10.1016\/j.ejor.2014.03.046"},{"doi-asserted-by":"crossref","unstructured":"Soria-Alcaraz Jorge, A., Carpio, M., Puga, H., Sotelo-Figueroa, M.: Methodology of design: A novel generic approach applied to the course timetabling problem. In: P. Melin, O. Castillo (eds.) Soft Computing Applications in Optimization, Control, and Recognition, Studies in Fuzziness and Soft Computing, vol. 294, pp. 287\u2013319. Springer Berlin Heidelberg (2013)","key":"45_CR24","DOI":"10.1007\/978-3-642-35323-9_12"},{"doi-asserted-by":"crossref","unstructured":"de Werra, D.: An introduction to timetabling. European Journal of Operational Research19(2), 151 \u2013 162 (1985)","key":"45_CR25","DOI":"10.1016\/0377-2217(85)90167-5"},{"unstructured":"Willemen, R.J.: School timetable construction: Algorithms and complexity. Ph.D. thesis, Institute for Programming research and Algorithms (2002)","key":"45_CR26"},{"doi-asserted-by":"crossref","unstructured":"Ochoa, G., Walker, J., Hyde, M., Curtois, T.: Adaptive evolutionary algorithms and extensions to the hyflex hyper-heuristic framework. In: Parallel Problem Solving from Nature - PPSN 2012, Lecture Notes in Computer Science, vol. 7492, pp. 418\u2013427. Springer, Berlin (2012).","key":"45_CR27","DOI":"10.1007\/978-3-642-32964-7_42"},{"doi-asserted-by":"crossref","unstructured":"Yu, E., Sung, K.S.: A genetic algorithm for a university weekly courses timetabling problem. Transactions in Operational Research 9, 703\u2013717 (2002).","key":"45_CR28","DOI":"10.1111\/1475-3995.00383"}],"container-title":["Studies in Computational Intelligence","Nature-Inspired Design of Hybrid Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47054-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T06:48:36Z","timestamp":1568616516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47054-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,10]]},"ISBN":["9783319470535","9783319470542"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47054-2_45","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2016,12,10]]}}}