Metaheuristics for University Course Timetabling

The work presented in this thesis concerns the problem of timetabling at universities – particularly course-timetabling, and examines the various ways in which metaheuristic techniques might be applied to these sorts of problems. Using a popular benchmark version of a university course timetabling problem, we examine the implications of using a “twostaged” algorithmic approach, whereby in stage-one only the mandatory constraints are considered for satisfaction, with stage-two then being concerned with satisfying the remaining constraints but without re-breaking any of the mandatory constraints in the process. Consequently, algorithms for each stage of this approach are proposed and analysed in detail. For the first stage we examine the applicability of the so-called Grouping Genetic Algorithm (GGA). In our analysis of this algorithm we discover a number of scaling-up issues surrounding the general GGA approach and discuss various reasons as to why this is so. Two separate ways of enhancing general performance are also explored. Secondly, an Iterated Heuristic Search algorithm is also proposed for the same problem, and in experiments it is shown to outperform the GGA in almost all cases. Similar observations to these are also witnessed in a second set of experiments, where the analogous problem of colouring equipartite graphs is also considered. Two new metaheuristic algorithms are also proposed for the second stage of the twostaged approach: an evolutionary algorithm (with a number of new specialised evolutionary operators), and a simulated annealing-based approach. Detailed analyses of both algorithms are presented and reasons for their relative benefits and drawbacks are discussed. Finally, suggestions are also made as to how our best performing algorithms might be modified in order to deal with further “real-world” constraints. In our analyses of these modified algorithms, as well as witnessing promising behaviour in some cases, we are also able to highlight some of the limitations of the two-stage approach in certain cases.

[1]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

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

[3]  Robert Sabourin,et al.  A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem , 2004, PATAT.

[4]  Kenneth A. De Jong,et al.  Measurement of Population Diversity , 2001, Artificial Evolution.

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

[6]  Laurent Péridy,et al.  Constraint Logic Programming for Examination Timetabling , 1996, J. Log. Program..

[7]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

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

[9]  Edmund K. Burke,et al.  The Automation of the Timetabling Process in Higher Education , 1995 .

[10]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

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

[12]  Ben Paechter,et al.  Application of the Grouping Genetic Algorithm to University Course Timetabling , 2005, EvoCOP.

[13]  Geoffrey C. Fox,et al.  A Comparison of Annealing Techniques for Academic Course Scheduling , 1997, PATAT.

[14]  Kees Joost Batenburg,et al.  A New Exam Timetabling Algorithm , 2003 .

[15]  Emanuel Falkenauer,et al.  Applying Genetic Algorithms to Real-World Problems , 1999 .

[16]  H. Terashima-Marín,et al.  Evolution of Constraint Satisfaction strategies in examination timetabling , 1999 .

[17]  Rhyd Lewis,et al.  Metaheuristics can solve sudoku puzzles , 2007, J. Heuristics.

[18]  Feng Luo,et al.  Exploring the k-colorable landscape with Iterated Greedy , 1993, Cliques, Coloring, and Satisfiability.

[19]  Jano I. van Hemert,et al.  Graph Coloring with Adaptive Evolutionary Algorithms , 1998, J. Heuristics.

[20]  Sami Khuri,et al.  A grouping genetic algorithm for coloring the edges of graphs , 2000, SAC '00.

[21]  Carlos M. Fonseca,et al.  A Study of Examination Timetabling with Multiobjective Evolutionary Algorithms , 2001 .

[22]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[23]  Nicholas J. Radcliffe,et al.  Forma Analysis and Random Respectful Recombination , 1991, ICGA.

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

[25]  R. Sabourin,et al.  Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem , 2004 .

[26]  Jin-Kao Hao,et al.  A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.

[27]  Raymond Lister.  Annealing networks and fractal landscapes , 1993, IEEE International Conference on Neural Networks.

[28]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[29]  Gregor von Laszewski,et al.  Intelligent Structural Operators for the k-way Graph Partitioning Problem , 1991, ICGA.

[30]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[31]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[32]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[33]  Ben Paechter,et al.  Timetabling the Classes of an Entire University with an Evolutionary Algorithm , 1998, PPSN.

[34]  Jeffrey H. Kingston,et al.  The Complexity of Timetable Construction Problems , 1995, PATAT.

[35]  Luca Di Gaspero,et al.  Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.

[36]  Peter Ross,et al.  Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation , 1994, PPSN.

[37]  Dominique de Werra,et al.  Compactness and balancing in scheduling , 1977, Math. Methods Oper. Res..

[38]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[39]  Edmund K. Burke,et al.  Examination Timetabling in British Universities: A Survey , 1995, PATAT.

[40]  Halvard Arntzen,et al.  A Tabu Search Heuristic for a University Timetabling Problem , 2005 .

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

[42]  Ben Paechter,et al.  A local search for the timetabling problem , 2002 .

[43]  Pablo Moscato.  A memetic approach for the travelling salesman problem implementation of a computational ecology for , 1992 .

[44]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a 3-phase approach , 2007 .

[45]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[46]  Barbara M. Smith,et al.  The Phase Transition and the Mushy Region in Constraint Satisfaction Problems , 1994, ECAI.

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

[48]  Ben Paechter,et al.  An empirical analysis of the grouping genetic algorithm: the timetabling case , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

[50]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[51]  Jonathan S. Turner,et al.  Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[52]  Mauro Birattari,et al.  An effective hybrid approach for the university course timetabling problem , 2003 .

[53]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

[54]  Peter Ross,et al.  Some Observations about GA-Based Exam Timetabling , 1997, PATAT.

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

[56]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[57]  Edmund K. Burke,et al.  Specialised Recombinative Operators for Timetabling Problems , 1995, Evolutionary Computing, AISB Workshop.

[58]  David B. Fogel,et al.  An Introduction to Evolutionary Computation , 2022 .

[59]  Thomas Stützle,et al.  A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.

[60]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[61]  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).

[62]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[63]  George M. White,et al.  Towards The Construction Of Optimal Examination Schedules , 1979 .

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

[65]  Ben Paechter,et al.  New crossover operators for timetabling with evolutionary algorithms. , 2004 .

[66]  Kathryn A. Dowsland,et al.  A robust simulated annealing based examination timetabling system , 1998, Comput. Oper. Res..

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

[68]  Michael W. Carter,et al.  A Lagrangian Relaxation Approach To The Classroom Assignment Problem , 1989 .

[69]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[70]  Safaai Deris,et al.  University timetabling by constraint-based reasoning: A case study , 1997 .

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

[72]  Andrea Schaerf,et al.  Tabu Search Techniques for Large High-School Timetabling Problems , 1996, AAAI/IAAI, Vol. 1.

[73]  Gyuri Lajos.  Complete University Modular Timetabling Using Constraint Logic Programming , 1995, PATAT.

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

[75]  Shigeyoshi Tsutsui,et al.  Advances in evolutionary computing: theory and applications , 2003 .

[76]  Kathryn A. Dowsland,et al.  Variants of simulated annealing for the examination timetabling problem , 1996, Ann. Oper. Res..

[77]  Alberto Colorni,et al.  A genetic algorithm to solve the timetable problem , 1992 .

[78]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[79]  Frederick Ducatelle,et al.  Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..

[80]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

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

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

[83]  M. El-Sharkawi,et al.  Introduction to Evolutionary Computation , 2008 .

[84]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[85]  Emanuel Falkenauer,et al.  A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems , 1994, Evolutionary Computation.

[86]  Enzhe Yu,et al.  A genetic algorithm for a university weekly courses timetabling problem , 2002 .

[87]  Sanja Petrovic,et al.  A time-predefined approach to course timetabling , 2003 .

[88]  Zbigniew Michalewicz,et al.  The Significance of the Evaluation Function in Evolutionary Algorithms , 1999 .

[89]  G. Dueck.  New optimization heuristics , 1993 .

[90]  Margarida Vaz Pato,et al.  A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem , 2000, PATAT.

[91]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[92]  Sanja Petrovic,et al.  An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling , 2004, Metaheuristics for Multiobjective Optimisation.

[93]  Emanuel Falkenauer,et al.  Setting New Limits in Bin Packing with a Grouping GA Using Reduction , 1994 .

[94]  Emanuel Falkenauer,et al.  Solving Equal Piles with the Grouping Genetic Algorithm , 1995, ICGA.

[95]  Peter Ross,et al.  The Phase-Transition Niche for Evolutionary Algorithms in Timetabling , 1995, PATAT.

[96]  Peter I. Cowling,et al.  COMBINING HUMAN AND MACHINE INTELLIGENCE TO PRODUCE EFFECTIVE EXAMINATION TIMETABLES , 2002 .

[97]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[98]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a Three-Phase Approach , 2004, PATAT.

[99]  Marco Dorigo,et al.  Metaheuristics for High School Timetabling , 1998, Comput. Optim. Appl..

[100]  Dario Floreano,et al.  Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes , 2004, Evolutionary Computation.

[101]  Zbigniew Michalewicz,et al.  Inver-over Operator for the TSP , 1998, PPSN.

[102]  Yee Leung,et al.  Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis , 1997, IEEE Trans. Neural Networks.

[103]  Sanja Petrovic,et al.  A Multicriteria Approach to Examination Timetabling , 2000, PATAT.

[104]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[105]  Jonathan M. Thompson,et al.  GRASPing the Examination Scheduling Problem , 2002, PATAT.

[106]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[107]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

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

[109]  Marco Dorigo,et al.  Genetic Algorithms and Highly Constrained Problems: The Time-Table Case , 1990, PPSN.

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

[111]  Michael W. Carter,et al.  OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..