{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:03:26Z","timestamp":1742969006548,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319051697"},{"type":"electronic","value":"9783319051703"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05170-3_33","type":"book-chapter","created":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T13:53:08Z","timestamp":1395841988000},"page":"481-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generic Memetic Algorithm for Course Timetabling ITC2007"],"prefix":"10.1007","author":[{"given":"Soria-Alcaraz","family":"Jorge","sequence":"first","affiliation":[]},{"given":"Carpio","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Puga","family":"Hector","sequence":"additional","affiliation":[]},{"given":"Melin","family":"Patricia","sequence":"additional","affiliation":[]},{"given":"Terashima-Marin","family":"Hugo","sequence":"additional","affiliation":[]},{"given":"Cruz","family":"Laura","sequence":"additional","affiliation":[]},{"given":"Sotelo-Figueroa","family":"Marco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,27]]},"reference":[{"key":"33_CR1","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)","DOI":"10.1007\/3-540-61794-9_66"},{"key":"33_CR2","unstructured":"Willemen, R.J.: School timetable construction: algorithms and complexity. Ph.D. Thesis, Institute for Programming Research and Algorithms (2002)"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Lewis, R.: Metaheuristics for University course timetabling. Ph.D. thesis, University of Nottingham (2006)","DOI":"10.1007\/978-3-540-48584-1_9"},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong, Y.S., et al.: Classification of adaptive memetic algorithms: a comparative study. Syst. Man Cybern. Part B: Cybern. IEEE Trans. 36(1), 141\u2013152 (2006)","journal-title":"Syst. Man Cybern. Part B: Cybern. IEEE Trans."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Radcliffe, et al. 1994. Formal memetic algorithms, vol. 85. Evolutionary Computing. Lecture Notes in Computer Science, pp. 1\u201316. Springer, Berlin","DOI":"10.1007\/3-540-58483-8_1"},{"key":"33_CR6","unstructured":"Soria-Alcaraz\u00a0Jorge, A., et al.: Methodology of design: a novel generic approach applied to the course timetabling problem, vol. 451. Studies in Computational Intelligence. Springer Berlin (2013b)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Soria-Alcaraz\u00a0Jorge, A., et al.: Comparison of Metaheuristic algorithms with a methodology of design for the evaluation of hard constraints over the course timetabling problem, vol. 451. Studies in Computational Intelligence. Springer, Berlin (2013a)","DOI":"10.1007\/978-3-642-33021-6_23"},{"issue":"2","key":"33_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D de Werra","year":"1985","unstructured":"de Werra, D.: An introduction to timetabling. Eur. J. Oper. Res. 19(2), 151\u2013162 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M Carter","year":"1986","unstructured":"Carter, M.: A survey of practical applications of examination timetabling algorithms. Oper. Res. 34, 193\u2013202 (1986)","journal-title":"Oper. Res."},{"key":"33_CR10","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), vol. 1153, pp. 146\u2013161. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61794-9_57"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(95)00100-X","volume":"26","author":"P Boizumault","year":"1996","unstructured":"Boizumault, P., et al.: Logic programming for examination timetabling. Logic Program 26, 217\u2013233 (1996)","journal-title":"Logic Program"},{"issue":"1","key":"33_CR12","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.: Adaptive Tabu Search for course timetabling. Eur. J. Oper. Res. 200(1), 235\u2013244 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR13","first-page":"277","volume":"9","author":"A Colorni","year":"1997","unstructured":"Colorni, A., et al.: Metaheuristics for high-school timetabling. Comput. Optim. Appl. 9, 277\u2013298 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1111\/1475-3995.00383","volume":"9","author":"E Yu","year":"2002","unstructured":"Yu, E., Sung, K.S.: A genetic algorithm for a University Wekly courses timetabling problem. Int. Trans. Oper. Res. 9, 703\u2013717 (2002)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"33_CR15","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C. Nothegger","year":"2012","unstructured":"Nothegger, C., Mayer, A., Chwatal, A., & Raidl, G. R.: Solving the post enrolment course timetabling problem by ant colony optimization. Annals of Operations Research. 194(1), 325\u2013339 (2012)","journal-title":"Annals of Operations Research."},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Socha, K., et al.: A MAX-MIN Ant system for the University Course timetabling Problem. In: Dorigo, M., Caro, G.D., Samples, M. (eds.) Proceedings of Ants 2002\u2014Third international workshop on Ant algorithms, Lecture Notes in Computer Science, pp. 1\u201313. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45724-0_1"},{"issue":"1","key":"33_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2010.01.044","volume":"206","author":"E Burke","year":"2010","unstructured":"Burke, E., et al.: Hybrid variable neighbourhood approaches to university exam timetabling. Eur. J. Oper. Res. 206(1), 46\u201353 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"33_CR18","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.ejor.2011.08.006","volume":"216","author":"NR Sabar","year":"2012","unstructured":"Sabar, N.R., et al.: A honey-bee mating optimization algorithm for educational timetabling problems. Eur. J. Oper. Res. 216(3), 533\u2013543 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"JM Thompson","year":"1998","unstructured":"Thompson, J.M., Dowsland, K.A.: A robust simulated annealing based examination timetabling system. Comput. Oper. Res. 25, 637\u2013648 (1998)","journal-title":"Comput. Oper. Res."},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10951-010-0171-3","volume":"14","author":"H Rudova","year":"2011","unstructured":"Rudova, H., et al.: Complex university course timetabling. J. Sched. 14, 187\u2013207 (2011). doi:10.1007\/s10951-010-0171-3","journal-title":"J. Sched."},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H Cambazard","year":"2012","unstructured":"Cambazard, H., et al.: Local search and constraint programming for the post enrolment-based course timetabling problem. Ann. Oper. Res. 194, 111\u2013135 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"33_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke, E.K., et al.: A graph-based hyper-heuristic for educational timetabling problems. Eur. J. Oper. Res. 176(1), 177\u2013192 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR23","first-page":"158","volume":"1","author":"JA Soria-Alcaraz","year":"2010","unstructured":"Soria-Alcaraz, J.A., et al.: Academic timetabling design using hyper-heuristics. Adv. Soft Comput. 1, 158\u2013164 (2010). ITT Springer-Verlag","journal-title":"Adv. Soft Comput."},{"issue":"1","key":"33_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ejor.2008.01.043","volume":"195","author":"PD Causmaecker","year":"2009","unstructured":"Causmaecker, P.D., et al.: A decomposed metaheuristic approach for a real-world university timetabling problem. Eur. J. Oper. Res. 195(1), 307\u2013318 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"33_CR25","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ejor.2010.04.011","volume":"207","author":"M Kahar","year":"2010","unstructured":"Kahar, M., Kendall, G.: The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution. Eur. J. Oper. Res. 207(2), 557\u2013565 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Conant-Pablos, S.E., et al.: Pipelining Memetic algorithms, constraint satisfaction, and local search for course timetabling. MICAI Mexican International Conference on Artificial Intelligence, vol. 1, pp 408\u2013419. (2009)","DOI":"10.1007\/978-3-642-05258-3_36"},{"key":"33_CR27","first-page":"37","volume-title":"Automated Algorithm Configuration and Parameter Tuning, Chap. 3","author":"HH Hoos","year":"2012","unstructured":"Hoos, H.H.: Automated Algorithm Configuration and Parameter Tuning, Chap. 3, pp. 37\u201371. Springer, Berlin (2012)"},{"issue":"1","key":"33_CR28","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., et al.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Studies in Computational Intelligence","Recent Advances on Hybrid Approaches for Designing Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05170-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T03:03:00Z","timestamp":1676862180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05170-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319051697","9783319051703"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05170-3_33","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}