A decomposed metaheuristic approach for a real-world university timetabling problem

European Journal of Operational Research

Volumn 195, Issue 1, 2009, Pages 307-318

  De Causmaecker, Patrick ^b   Demeester, Peter ^a   Vanden Berghe, Greet ^a  

^a ODISEE UNIVERSITY COLLEGE   (Belgium)

^b Katholieke Universiteit Leuven Campus Kortrijk   (Belgium)

Author keywords

Decomposed heuristic; Metaheuristics; Tabu search; Timetabling

Indexed keywords

TABU SEARCH;

DECOMPOSED HEURISTIC; METAHEURISTIC APPROACHES; METAHEURISTIC SEARCHES; METAHEURISTICS; NEW STRUCTURES; TEST RESULTS; TIME SLOTS; TIMETABLING; UNIVERSITY COURSE TIMETABLING PROBLEMS; UNIVERSITY TIMETABLING PROBLEMS;

HEURISTIC METHODS;

EID: 56149100173     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.01.043     Document Type: Article

References (46)

1. S. Abdulla, Heuristic approaches for university timetabling problems, Ph.D. Thesis, School of Computer Science and Information Technology, University of Nottingham, June 2006.
2. S. Abdullah, E.K. Burke, B. McCollum, An investigation of variable neighbourhood search for university course timetabling, in: Proceedings of the 2nd Multi-disciplinary International Conference on Scheduling: Theory and Applications (MISTA), New York, USA, pp. 413-427, July 2005.
3. S. Abdullah, E.K. Burke, B. McCollum, Using a randomised iterative improvement algorithm with composite neighbourhood structures for university course timetabling, in: Proceedings of the Metaheuristic International Conference 2005 (MIC'05), CD-Rom, Austria, Augustus 2005.
4. Al-Yakoob S.M., and Sherali H.D. Mathematical programming models and algorithms for a class faculty assignment problem. European Journal of Operational Research 173 2 (2006) 488-507
5. Alvarez-Valdes R., Crespo E., and Tamarit J.M. Assigning students to course sections using tabu search. Annals of Operations Research 96 (2000) 1-16
6. Asratian A.S., and de Werra D. A generalized class teacher model for some timetabling problems. European Journal of Operational Research 143 3 (2002) 531-542
7. Bardadym V.A. Computer-aided school and university timetabling: The new wave. Selected and Revised Papers of the First International Conference on Practice and Theory of Automated Timetabling, (PATAT 1995), Edinburgh. LNCS vol. 1153 (1996), Springer pp. 22-45
8. Burke E.K., Bykov Y., Newall J., and Petrovic S. A time-predefined approach to course timetabling. Yugoslav Journal of Operations Research 13 2 (2003) 139-151
9. Burke E.K., Elliman D.G., and Weare R.F. A university timetabling system based on graph colouring and constraint manipulation. Journal of Research on Computing in Education 27 1 (1994) 1-18
10. Burke E.K., Kendall G., and Soubeiga E. A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9 6 (2003) 451-470
11. E.K. Burke, J.H. Kingston, D. De Werra, Applications to timetabling, in: Jonathan Gross, Jay Yellen (Eds.), Handbook of Graph Theory, Chapman Hall/CRC Press, 2004, pp. 445-474.
12. Burke E.K., MacCarthy B.L., Petrovic S., and Qu R. Case-based reasoning in course timetabling: an attribute graph approach. Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development. Lecture Notes in Computer Science vol. 2080 (2001), Springer pp. 90-104
13. Burke E.K., MacCarthy B.L., Petrovic S., and Qu R. Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling. Selected and Revised Papers of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT) 2002. Lecture Notes in Computer Science vol. 2740 (2003), Springer pp. 276-286
14. Burke E.K., MacCarthy B.L., Petrovic S., and Qu R. Multiple-retrieval case based reasoning for course timetabling problems. Journal of the Operational Research Society 57 2 (2006) 148-162
15. Burke E.K., McCollum B., Meisels A., Petrovic S., and Qu R. A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research 179 (2007) 177-192
16. Burke E.K., and Petrovic S. Recent research directions in automated timetabling. European Journal of Operational Research 140 2 (2002) 266-280
17. Burke E.K., Petrovic S., and Qu R. Case based heuristic selection for timetabling problems. Journal of Scheduling 9 2 (2006) 115-132
18. M.P. Carrasco, M.V. Pato, A Potts neural network heuristic for the class/teacher timetabling problem, Applied Optimization, Metaheuristics: Computer Decision-making Book, Kluwer Academic Publishers, 2004, pp. 173-186.
19. Carrasco M.P., and Pato M.V. A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. European Journal of Operational Research 153 (2004) 65-79
20. Carter M.W., and Laporte G. Recent development in practical course timetabling. Selected and Revised Papers of the Second International Conference on Practice and Theory of Automated Timetabling, (PATAT 1997). LNCS vol. 1408 (1998), Springer, Toronto pp. 3-19
21. C. Cheng, L. Kang, N. Leung, M. White, Investigations of a constraint logic programming approach to university timetabling, in: Selected Papers of the First International Conference, LNCS, vol. 1153, Edinburgh, UK, 1995, pp. 112-129.
22. Colorni A., Dorigo M., and Maniezzo V. Metaheuristics for high-school timetabling. Computational Optimization and Applications 9 3 (1998) 277-298
23. Costa D. A tabu search algorithm for computing an operational timetable. European Journal of Operational Research 76 1 (1994) 98-110
24. Daskalaki S., and Birbas T. Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research 160 (2005) 106-120
25. de Werra D. An introduction to timetabling. European Journal of Operational Research 19 2 (1985) 151-162
26. Di Gaspero L., and Schaerf A. Multi-neighbourhood local search with application to course timetabling. Selected Revised Papers of the Fourth International Conference on Practice and Theory of Automated Timetabling (PATAT 2002). LNCS vol. 2740 (2003), Springer pp. 262-275
27. L. Di Gaspero, A. Schaerf, A multineighbourhood local search solver for the timetabling competition TTComp 2002, in: Proceedings of the Fifth International Conference, on Practice and Theory of Automated Timetabling, (PATAT 2004), Pittsburgh, USA, 2004, pp. 475-478.
28. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Berlin
29. Guéret C., Jussien N., Boizumault P., and Prins C. Building university timetables using constraint logic programming. Selected and Revised Papers of the 1st International Conference on Practice and Theory of Automated Timetabling, (PATAT 1995). LNCS vol. 1153 (1996), Springer, Edinburgh pp. 130-145
30. Hertz A. Tabu search for large scale timetabling problems. European Journal of Operational Research 54 (1991) 39-47
31. Hertz A. Finding a feasible course schedule using tabu search. Discrete Applied Mathematics 35 (1992) 255-270
32. Hopfield1 J.J., and Tank D.W. Neural computation of decisions in optimization problems. Biological Cybernetics 52 3 (1985) 141-152
33. International Timetabling Competition: .
34. B. Jaumard, J. Cordeau, R. Morales, Efficient timetabling solution with tabu search, Working Paper, Available from Metaheuristics Network - International Timetabling Competition ().
35. Kingston J.H. A tiling algorithm for high school timetabling. Selected and Revised Papers of the Fifth International Conference on Practice and Theory of Automated Timetabling, (PATAT 2004). LNCS vol. 3616 (2005), Springer, Pittsburgh pp. 208-225
36. Kostuch P. The university course timetabling problem with a three-phase approach. Selected and Revised Papers of the Fifth International Conference on Practice and Theory of Automated Timetabling, (PATAT 2004). LNCS vol. 3616 (2005), Springer, Pittsburgh pp. 109-125
37. R. Lewis, Metaheuristics for University Course Timetabling, Ph.D. Thesis, August 2006.
38. Lewis R. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30 1 (2007) 167-190
39. B. McCollum, University timetabling: Bridging the gap between research and practice, in: Proceedings of Sixth International Conference on Practice and Theory of Automated Timetabling, (PATAT 2006), Brno, 2006, pp. 15-35.
40. Nonobe K., and Ibaraki T. A tabu search approach to the CSP (Constraint Satisfaction Problem) as a general problem solver. European Journal of Operational Research 106 (1998) 599-623 Special Issue on Tabu Search
41. Petrovic S., and Burke E. University timetabling. In: Leung J. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis vol. 45 (2004), CRC Press (Chapter 45), pp. 1-23
42. Rudova H., and Murray K. University course timetabling with soft constraints. Selected and Revised Papers of the 4th International Conference on Practice and Theory of Automated Timetabling, (PATAT 2002). LNCS vol. 2740 (2003), Springer, Gent pp. 311-329
43. Schaerf A. A survey of automated timetabling. Artificial Intelligence Review 13 2 (1999) 87-127
44. Schaerf A. Local search techniques for large high school timetabling problems. IEEE Transactions on Systems Man and Cybernetics Part A: Systems and Human 29 4 (1999) 368-377
45. K. Socha, M. Sampels, M. Manfrin, Ant algorithms for the university course timetabling problem with regard to the state-of-the-art, in: Proceedings of EvoCOP 2003, 3rd European Workshop on Evolutionary Computation in Combinatorial Optimization, LNCS, vol. 2611, 2003, pp. 334-345.
46. Tripathy A. Computerised decision aid for timetabling - A case analysis. Discrete Applied Mathematics 35 3 (1992) 313-323