Course timetabling using evolutionary operators

Timetabling is the problem of scheduling a set of events while satisfying various constraints. In this paper, we develop and study the performance of an evolutionary algorithm, designed to solve a specific variant of the timetabling problem. Our aim here is twofold: to develop a competitive algorithm, but more importantly, to investigate the applicability of evolutionary operators to timetabling. To this end, the introduced algorithm is tested using a benchmark set. Comparison with other algorithms shows that it achieves better results in some, but not all instances, signifying strong and weak points. To further the study, more comprehensive tests are performed in connection with another evolutionary algorithm that uses strictly group-based operators. Our analysis of the empirical results leads us to question single-level selection, proposing, in its place, a multi-level alternative.

[1]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[2]  Wilhelm Erben,et al.  A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling , 2000, PATAT.

[3]  Ben Paechter,et al.  Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition , 2010, INFORMS J. Comput..

[4]  Stephen C. H. Leung,et al.  A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems , 2010, Eur. J. Oper. Res..

[5]  Ravindra K. Ahuja,et al.  Very Large-Scale Neighborhood Search , 2011 .

[6]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

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

[8]  Regina Berretta,et al.  A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

[9]  Sancho Salcedo-Sanz,et al.  A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups , 2009, Expert Syst. Appl..

[10]  Ravindra K. Ahuja,et al.  Very large-scale neighborhood search , 2000 .

[11]  Carlos Cotta,et al.  Memetic Algorithms in Planning, Scheduling, and Timetabling , 2007, Evolutionary Scheduling.

[12]  Graham Kendall,et al.  A honey-bee mating optimization algorithm for educational timetabling problems , 2012, Eur. J. Oper. Res..

[13]  Emanuel Falkenauer,et al.  Genetic Algorithms and Grouping Problems , 1998 .

[14]  A. Eiben,et al.  Stepwise adaption of weights with refinement and decay on constraint satisfaction problems , 2001 .

[15]  Ben Paechter,et al.  Finding Feasible Timetables Using Group-Based Operators , 2007, IEEE Transactions on Evolutionary Computation.

[16]  A. Alkan,et al.  Memetic algorithms for timetabling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[17]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[18]  Wolfgang Banzhaf,et al.  An informed genetic algorithm for the examination timetabling problem , 2010, Appl. Soft Comput..

[19]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

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

[21]  Çagdas Hakan Aladag,et al.  The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem , 2009, Expert Syst. Appl..

[22]  Edmund K. Burke,et al.  A Memetic Algorithm for University Exam Timetabling , 1995, PATAT.

[23]  Grigorios N. Beligiannis,et al.  Applying evolutionary computation to the school timetabling problem: The Greek case , 2008, Comput. Oper. Res..

[24]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[25]  Ben Paechter,et al.  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem , 2002, PATAT.

[26]  Peter Ross,et al.  Genetic algorithms and timetabling , 2003 .

[27]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[28]  Dan Qaurooni.  A memetic algorithm for course timetabling , 2011, GECCO '11.

[29]  Pupong Pongcharoen,et al.  Stochastic Optimisation Timetabling Tool for university course scheduling , 2008 .

[30]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[31]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[32]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .