Solving the Teacher Assignment-Course Scheduling Problem by a Hybrid Algorithm

This paper presents a hybrid algorithm for solving a timetabling problem, which is commonly encountered in many universities. The problem combines both teacher assignment and course scheduling problems simultaneously, and is presented as a mathematical programming model. However, this problem becomes intractable and it is unlikely that a proven optimal solution can be obtained by an integer programming approach, especially for large problem instances. A hybrid algorithm that combines an integer programming approach, a greedy heuristic and a modified simulated annealing algorithm collaboratively is proposed to solve the problem. Several randomly generated data sets of sizes comparable to that of an institution in Indonesia are solved using the proposed algorithm. Computational results indicate that the algorithm can overcome difficulties of large problem sizes encountered in previous related works. Keywords—Timetabling problem, mathematical programming model, hybrid algorithm, simulated annealing.

[1]  Edmund K. Burke,et al.  A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems , 1995, ICGA.

[2]  Ramón Alvarez-Valdés,et al.  Design and implementation of a course scheduling system using Tabu Search , 2002, Eur. J. Oper. Res..

[3]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[4]  Thomas Stützle,et al.  A landscape analysis for a Hybrid Approximate Algorithm on a Timetabling Problem , 2004 .

[5]  Aldy Gunawan,et al.  An improvement heuristic for the timetabling problem , 2007 .

[6]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

[7]  Tuan-Anh Duong,et al.  Combining Constraint Programming and Simulated Annealing on University Exam Timetabling , 2004, RIVF.

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Sanja Petrovic,et al.  Case-Based Initialisation of Metaheuristics for Examination Timetabling , 2005 .

[10]  David Abramson,et al.  Simulated Annealing Cooling Schedules for the School Timetabling Problem , 1999 .

[11]  Peter J. Stuckey,et al.  A Hybrid Algorithm for the Examination Timetabling Problem , 2002, PATAT.

[12]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[13]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[14]  Mauro Birattari,et al.  An effective hybrid algorithm for university course timetabling , 2006, J. Sched..

[15]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[16]  Aldy Gunawan,et al.  A Mathematical Programming Model For A Timetabling Problem , 2006, CSC.