{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T22:36:46Z","timestamp":1782772606613,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540485827","type":"print"},{"value":"9783540485841","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-48584-1_9","type":"book-chapter","created":{"date-parts":[[2007,4,24]],"date-time":"2007-04-24T16:35:52Z","timestamp":1177432552000},"page":"237-272","source":"Crossref","is-referenced-by-count":33,"title":["Metaheuristics for University Course Timetabling"],"prefix":"10.1007","author":[{"given":"Rhydian","family":"Lewis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Paechter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivia","family":"Rossi-Doria","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1_09","unstructured":"http:\/\/www.idsia.ch\/Files\/ttcomp2002\/"},{"key":"9_CR2_09","unstructured":"http:\/\/www.emergentcomputing.org\/timetabling\/harderinstances"},{"key":"9_CR3_09","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D Abramson","year":"1991","unstructured":"D. Abramson, \u201cConstructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms, \u201dManagement Science, vol. 37, pp. 98-113, 1991.","journal-title":"Management Science"},{"key":"9_CR4_09","first-page":"1","volume":"16","author":"D Abramson","year":"1996","unstructured":"D. Abramson, H. Krishnamoorthy, and H. Dang,\u201c Simulated Annealing Cool-ing Schedules for the School Timetabling Problem, \u201dAsia-Pacific Journal of Operational Research, vol. 16, pp. 1-22, 1996.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"9_CR5_09","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/0-387-25383-1_3","volume-title":"Metaheuristics: Progress as Real Problem Solvers, vol. 32, Computer Science Interfaces Series","author":"H Arntzen","year":"2005","unstructured":"H. Arntzen and A. L\u00f8kketangen, \u201cA Tabu Search Heuristic for a University Timetabling Problem, \u201din Metaheuristics: Progress as Real Problem Solvers, vol. 32, Computer Science Interfaces Series, T Ikabaki, K. Nonobe, and M. Yagiura, Eds. Berlin: Springer-Verlag, 2005, pp. 65-86."},{"key":"9_CR6_09","unstructured":"M. Birattari, T. St\u00fctzle, L. Paquete, and K. Varrentrapp, \u201cA Racing Algorithm for Configuring Metaheuristics, \u201dpresented at The Genetic and Evolutionary Computation Conference (GECCO) 2002, New York, 2002."},{"key":"9_CR7_09","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Brelaz","year":"1979","unstructured":"D. Brelaz, \u201cNew methods to color the vertices of a graph, \u201dCommun. ACM, vol. 22, pp. 251-256, 1979.","journal-title":"Commun. ACM"},{"key":"9_CR8_09","doi-asserted-by":"crossref","unstructured":"E. Burke, D. Elliman, and R. Weare, \u201cSpecialised Recombinative Operators for Timetabling Problems,\u201d in The Artificial Intelligence and Simulated Behaviour Workshop on Evolutionary Computing, vol. 993, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 1995, pp. 75-85.","DOI":"10.1007\/3-540-60469-3_26"},{"key":"9_CR9_09","doi-asserted-by":"crossref","first-page":"257","DOI":"10.2190\/NGYR-EXLB-RK79-K6NU","volume":"23","author":"E Burke","year":"1995","unstructured":"E. Burke, D. Elliman, and R. Weare, \u201cThe Automation of the Timetabling Process in Higher Education, \u201dJournal of Education Technology Systems, vol. 23, pp. 257-266, 1995.","journal-title":"Journal of Education Technology Systems"},{"key":"9_CR10_09","unstructured":"E. Burke, D. Elliman, and R. Weare, \u201cA Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems., \u201d presented at Genetic Algo-rithms: Proceedings of the Sixth International Conference (ICGA95), 1995."},{"key":"9_CR11_09","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E Burke","year":"2002","unstructured":"E. Burke and M. Petrovic, \u201cRecent Research Directions in Automated Time-tabling, \u201dEuropean Journal of Operational Research, vol. 140, pp. 266-280, 2002.","journal-title":"\u201dEuropean Journal of Operational Research"},{"key":"9_CR12_09","first-page":"76","volume-title":"Practice and Theory of Auto-mated Timetabling (PATAT) I, vol. 1153, Lecture Notes in Computer Science","author":"EK Burke","year":"1996","unstructured":"E. K. Burke, D. G. Elliman, P. H. Ford, and R. Weare, \u201cExamination Time- tabling in British Universities: A Survey, \u201din Practice and Theory of Auto-mated Timetabling (PATAT) I, vol. 1153, Lecture Notes in Computer Science, E. Burke and P. Ross, Eds. Berlin: Springer-Verlag, 1996, pp. 76-92."},{"key":"9_CR13_09","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"EK Burke","year":"1999","unstructured":"E. K. Burke and J. P. Newall, \u201cA Multi-Stage Evolutionary Algorithm for the Timetable Problem, \u201dIEEE Transactions on Evolutionary Computation, vol. 3, pp. 63-74, 1999.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"9_CR14_09","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M Carter","year":"1986","unstructured":"M. Carter, \u201cA Survey of Practical Applications of Examination Timetabling Algorithms, \u201dOperations Research, vol. 34, pp. 193-202, 1986.","journal-title":"Operations Research"},{"key":"9_CR15_09","first-page":"3","volume-title":"Practice and Theory of Automated Timetabling (PATAT) I","author":"M Carter","year":"1996","unstructured":"M. Carter and G. Laporte, \u201cRecent Developments in Practical Examination Timetabling, \u201din Practice and Theory of Automated Timetabling (PATAT) I, vol. 1153, E. Burke and P. Ross, Eds. Berlin: Springer-Verlag, 1996, pp. 3-21."},{"key":"9_CR16_09","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"M Carter","year":"1996","unstructured":"M. Carter, G. Laporte, and S. Y. Lee, \u201cExamination Timetabling: Algorithmic Strategies and Applications, \u201dJournal of the Operational Research Society, vol. 47, pp. 373-383, 1996.","journal-title":"Journal of the Operational Research Society"},{"key":"9_CR17_09","first-page":"3","volume-title":"Practice and Theory of Automated Timetabling (PATAT) II, vol. 1408, Lecture Notes in Computer Science","author":"M Carter","year":"1998","unstructured":"M. Carter and G. Laporte, \u201cRecent Developments in Practical Course Time- tabling, \u201din Practice and Theory of Automated Timetabling (PATAT) II, vol. 1408, Lecture Notes in Computer Science, E. Burke and M. Carter, Eds. Ber-lin: Springer-Verlag, 1998, pp. 3-19."},{"key":"9_CR18_09","first-page":"233","volume-title":"Practice and Theory of Automated Timetabling (PATAT) IV, vol. 2740, Lecture Notes in Computer Science","author":"S Casey","year":"2002","unstructured":"S. Casey and J. Thompson, \u201cGRASPing the Examination Scheduling Prob-lem, \u201din Practice and Theory of Automated Timetabling (PATAT) IV, vol. 2740, Lecture Notes in Computer Science, E. Burke and P. De Causmaecker, Eds. Berlin: Springer-Verlag, 2002, pp. 233-244."},{"key":"9_CR19_09","volume-title":"\u201cAn Effective Hybrid Approach for the University Course Timetabling Problem, \u201d","author":"M Chiarandini","year":"2003","unstructured":"M. Chiarandini, K. Socha, M. Birattari, and O. Rossi-Doria, \u201cAn Effective Hybrid Approach for the University Course Timetabling Problem, \u201dTechnical Report AIDA-2003-05, FG Intellektik, FB Informatik, TU Darmstadt, Ger-many, 2003."},{"key":"9_CR20_09","first-page":"277","volume":"9","author":"A Colorni","year":"1997","unstructured":"A. Colorni, M. Dorigo, and V. Maniezzo, \u201cMetaheuristics for high-school timetabling, \u201dComputational Optimization and Applications, vol. 9, pp. 277-298, 1997.","journal-title":"Computational Optimization and Applications"},{"key":"9_CR21_09","first-page":"283","volume-title":"Practice and Theory of Automated Timetabling (PATAT ) I, vol. 1153, Lecture Notes in Computer Science","author":"T Cooper","year":"1996","unstructured":"T. Cooper and J. Kingston, \u201cThe Complexity of Timetable Construction Problems, \u201din Practice and Theory of Automated Timetabling (PATAT ) I, vol. 1153, Lecture Notes in Computer Science, E. Burke and P. Ross, Eds. Berlin: Springer-Verlag, 1996, pp. 283-295."},{"key":"9_CR22_09","unstructured":"D. Corne, P. Ross, and H. Fang, \u201cEvolving Timetables, \u201din The Practical Handbook of Genetic Algorithms, vol. 1, L. C. Chambers, Ed.: CRC Press, 1995, pp. 219-276."},{"key":"9_CR23_09","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/11593577_17","volume-title":"Practice and Theory of Automated Timetabling (PATAT) V, vol. 3616, Lec-ture Notes in Computer Science","author":"P Cote","year":"2005","unstructured":"P. Cote, T. Wong, and R. Sabourin, \u201cApplication of a Hybrid Multi-Objective Evolutionary Algorithm to the Uncapacitated Exam Proximity Problem, \u201din Practice and Theory of Automated Timetabling (PATAT) V, vol. 3616, Lec-ture Notes in Computer Science, E. Burke and M. Trick, Eds. Berlin: Springer-Verlag, 2005, pp. 294-312."},{"key":"9_CR24_09","unstructured":"P. Cowling, S. Ahmadi, P. Cheng, and R. Barone, \u201cCombining Human and Machine Intelligence to Produce Effective Examination Timetables, \u201d pre-sented at The Forth Asia-Pacific Conference on Simulated Evolution and Learning (SEAL2002), Singapore, 2002."},{"key":"9_CR25_09","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"AE Eiben","year":"1998","unstructured":"A. E. Eiben, J. K. van der Hauw, and J. I. van Hemert, \u201cGraph Coloring with Adaptive Evolutionary Algorithms, \u201dJournal of Heuristics, vol. 4, pp. 25-46, 1998.","journal-title":"Journal of Heuristics"},{"key":"9_CR26_09","first-page":"146","volume-title":"Practice and Theory of Automated Timetabling (PATAT) II, vol. 1408, Lecture Notes in Computer Science","author":"S Elmohamed","year":"1998","unstructured":"S. Elmohamed, G. Fox, and P. Coddington, \u201cA Comparison of Annealing Techniques for Academic Course Scheduling, \u201din Practice and Theory of Automated Timetabling (PATAT) II, vol. 1408, Lecture Notes in Computer Science, E. Burke and M. Carter, Eds. Berlin: Springer-Verlag, 1998, pp. 146-166."},{"key":"9_CR27_09","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-44629-X_9","volume-title":"Practice and Theory of Automated Timetabling (PATAT) III, vol. 2079, Lecture Notes in Computer Science","author":"E Erben","year":"2001","unstructured":"E. Erben, \u201cA Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling, \u201din Practice and Theory of Automated Timetabling (PATAT) III, vol. 2079, Lecture Notes in Computer Science, E. Burke and W. Erben, Eds. Berlin: Springer-Verlag, 2001, pp. 132-158."},{"key":"9_CR28_09","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"S. Even, A. Itai, and A. Shamir, \u201cOn the complexity of Timetable and Multi- commodity Flow Problems, \u201dSIAM Journal of Computing, vol. 5, pp. 691- 703, 1976.","journal-title":"SIAM Journal of Computing"},{"key":"9_CR29_09","unstructured":"E. Falkenauer, Genetic Algorithms and Grouping Problems: John Wiley and Sons, 1998."},{"key":"9_CR30_09","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C. Gelatt, and M. Vecchi, \u201cOptimization by Simulated An-nealing, \u201dScience, pp. 671-680, 1983.","DOI":"10.1126\/science.220.4598.671"},{"key":"9_CR31_09","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11593577_7","volume-title":"Practice and Theory of Automated Timetabling (PATAT) V, vol. 3616, Lecture Notes in Computer Science","author":"P Kostuch","year":"2005","unstructured":"P. Kostuch, \u201cThe University Course Timetabling Problem with a 3-Phase Approach, \u201din Practice and Theory of Automated Timetabling (PATAT) V, vol. 3616, Lecture Notes in Computer Science, E. Burke and M. Trick, Eds. Berlin: Springer-Verlag, 2005, pp. 109-125."},{"key":"9_CR32_09","unstructured":"R. Lewis and B. Paechter, \u201cNew Crossover Operators for Timetabling with Evolutionary Algorithms, \u201dpresented at The Fifth International Conference on Recent Advances in Soft Computing RASC2004, Nottingham, England, 2004."},{"key":"9_CR33_09","first-page":"144","volume-title":"Evolutionary Computation in Combinato rial Optimization (EvoCop), vol. 3448, Lecture Notes in Computer Science","author":"R Lewis","year":"2005","unstructured":"R. Lewis and B. Paechter, \u201cApplication of the Grouping Genetic Algorithm to University Course Timetabling, \u201din Evolutionary Computation in Combinato rial Optimization (EvoCop), vol. 3448, Lecture Notes in Computer Science, G. Raidl and J. Gottlieb, Eds. Berlin: Springer-Verlag, 2005, pp. 144-153."},{"key":"9_CR34_09","unstructured":"R. Lewis and B. Paechter, \u201cAn Empirical Analysis of the Grouping Genetic Algorithm: The Timetabling Case, \u201dpresented at the IEEE Congress on Evo-lutionary Computation (IEEE CEC) 2005, Edinburgh, Scotland, 2005."},{"key":"9_CR35_09","doi-asserted-by":"crossref","unstructured":"R. Lewis and B. Paechter, \u201cFinding Feasible Timetables using Group Based Operators,\u201d (Forthcoming) Accepted for publication in the IEEE Trans. Evo-lutionary Computation, 2006.","DOI":"10.1109\/TEVC.2006.885162"},{"key":"9_CR36_09","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz, \u201cThe Significance of the Evaluation Function in Evolution- ary Algorithms,\u201d presented at The Workshop on Evolutionary Algorithms, Institute for Mathematics and Its Applications, University of Minnesota, Minneapolis, Minnesota, 1998.","DOI":"10.1007\/978-1-4612-1542-4_8"},{"key":"9_CR37_09","first-page":"865","volume-title":"Parallel Problem Solving from Nature (PPSN) V, vol. 1498, Lecture Notes in Com-puter Science","author":"B Paechter","year":"1998","unstructured":"B. Paechter, R. Rankin, A. Cumming, and T. Fogarty, \u201cTimetabling the Classes of an Entire University with an Evolutionary Algorithm, \u201din Parallel Problem Solving from Nature (PPSN) V, vol. 1498, Lecture Notes in Com-puter Science, T. Baeck, A. Eiben, M. Schoenauer, and H. Schwefel, Eds. Berlin: Springer-Verlag, 1998, pp. 865-874."},{"key":"9_CR38_09","first-page":"191","volume-title":"the Third International Conference on Genetic Algorithms","author":"JT Richardson","year":"1989","unstructured":"J. T. Richardson, M. R. Palmer, G. Liepins, and M. Hilliard, \u201cSome Guide-lines for Genetic Algorithms with Penalty Functions., \u201din the Third International Conference on Genetic Algorithms, J. D. Schaffer, Ed. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc, 1989, pp. 191-197."},{"key":"9_CR39_09","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1007\/3-540-58484-6_298","volume-title":"Parallel Problem Solving from Nature (PPSN) III, vol. 866, Lecture Notes in Computer Science","author":"P Ross","year":"1994","unstructured":"P. Ross, D. Corne, and H.-L. Fang, \u201cImproving Evolutionary Timetabling with Delta Evaluation and Directed Mutation, \u201din Parallel Problem Solving from Nature (PPSN) III, vol. 866, Lecture Notes in Computer Science, Y. Davidor, H. Schwefel, and M. Reinhard, Eds. Berlin: Springer-Verlag, 1994, pp. 556-565."},{"key":"9_CR40_09","first-page":"309","volume-title":"Practice and Theory of Auto mated Timetabling (PATAT) I, vol. 1153, Lecture Notes in Computer Science","author":"P Ross","year":"1996","unstructured":"P. Ross, D. Corne, and H. Terashima-Marin, \u201cThe Phase-Transition Niche for Evolutionary Algorithms in Timetabling, \u201din Practice and Theory of Auto mated Timetabling (PATAT) I, vol. 1153, Lecture Notes in Computer Science, E. Burke and P. Ross, Eds. Berlin: Springer-Verlag, 1996, pp. 309-325."},{"key":"9_CR41_09","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/978-3-642-18965-4_30","volume-title":"Advances in Evolutionary Computing: Theory and Applications","author":"P Ross","year":"2003","unstructured":"P. Ross, E. Hart, and D. Corne, \u201cGenetic Algorithms and Timetabling, \u201din Advances in Evolutionary Computing: Theory and Applications, A. Ghosh and K. Tsutsui, Eds.: Springer-Verlag, New York., 2003, pp. 755-771."},{"key":"9_CR42_09","unstructured":"O. Rossi-Doria, J. Knowles, M. Sampels, K. Socha, and B. Paechter, \u201cA Lo-cal Search for the Timetabling Problem, \u201dpresented at Practice And Theory of Automated Timetabling (PATAT) IV, Gent, Belgium, 2002."},{"key":"9_CR43_09","first-page":"329","volume-title":"Practice and Theory of Automated Timetabling (PATAT) IV, vol. 2740, Lecture Notes in Computer Science","author":"O Rossi-Doria","year":"2002","unstructured":"O. Rossi-Doria, M. Samples, M. Birattari, M. Chiarandini, J. Knowles, M. Manfrin, M. Mastrolilli, L. Paquete, B. Paechter, and T. St\u00fctzle, \u201cA Compari-son of the Performance of Different Metaheuristics on the Timetabling Prob-lem, \u201din Practice and Theory of Automated Timetabling (PATAT) IV, vol. 2740, Lecture Notes in Computer Science, E. Burke and P. De Causmaecker, Eds. Berlin: Springer-Verlag, 2002, pp. 329-351."},{"key":"9_CR44_09","unstructured":"W. Salwach, \u201cGenetic Algorithms in Solving Constraint Satisfaction Prob- lems: The Timetabling Case, \u201dBadania Operacyjne i Decyzje, 1997."},{"key":"9_CR45_09","unstructured":"A. Schaerf, \u201cTabu Search Techniques for Large High-School Timetabling Problems, \u201din Proceedings of the Thirteenth National Conference on Artificial Intelligence. Portland (OR): AAAI Press\/ MIT Press, 1996, pp. 363-368."},{"key":"9_CR46_09","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"A. Schaerf, \u201cA Survey of Automated Timetabling,\u201d Artificial Intelligence Review, vol. 13, pp. 87-127, 1999.","journal-title":"Artificial Intelligence Review"},{"key":"9_CR47_09","unstructured":"K. Socha and M. Samples, \u201cAnt Algorithms for the University Course Time- tabling Problem with Regard to the State-of-the-Art, \u201din Evolutionary Com-putation in Combinatorial Optimization (EvoCOP 2003), vol. 2611, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2003, pp. 334-345."},{"key":"9_CR48_09","unstructured":"H. Terashima-Marin, P. Ross, and M. Valenzuela-Rendon, \u201cEvolution of Constraint Satisfaction Strategies in Examination Timetabling, \u201dpresented at The Genetic and Evolutionary Computation Conference (GECCO), 2000."},{"key":"9_CR49_09","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"JM Thompson","year":"1998","unstructured":"J. M. Thompson and K. A. Dowsland, \u201cA Robust Simulated Annealing based Examination Timetabling System, \u201dComputers and Operations Research, vol. 25, pp. 637-648, 1998.","journal-title":"Computers and Operations Research"},{"key":"9_CR50_09","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applica-tions","author":"P Laarhoven van","year":"1987","unstructured":"P. van Laarhoven and E. Aarts, Simulated Annealing: Theory and Applica-tions. Reidel, The Netherlands: Kluwer Academic Publishers, 1987."},{"key":"9_CR51_09","first-page":"219","volume":"17","author":"G White","year":"1979","unstructured":"G. White and W. Chan, \u201cTowards the Construction of Optimal Examination Schedules, \u201dINFOR, vol. 17, pp. 219-229, 1979.","journal-title":"INFOR"}],"container-title":["Studies in Computational Intelligence","Evolutionary Scheduling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48584-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:13:39Z","timestamp":1620015219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48584-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540485827","9783540485841"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48584-1_9","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}