An integrated hybrid approach to the examination timetabling problem

This paper is derived from an interest in the development of automated approaches to tackle examination timetabling problems effectively. We propose a hybrid approach that incorporates effective heuristic operators within the great deluge algorithm. The latter was chosen because of consistently good performances being reported within the examination timetabling research domain. The additional heuristic procedures further enhance the overall effectiveness of this integrated hybrid approach. These procedures are drawn from methodologies that have appeared in the literature under term the "electromagnetic-like mechanism". The aim is to move sample points towards a high quality solution while avoiding local optima by utilising a calculated force value. This value, which is calculated dynamically, is treated as a decay rate in determining the level within the great deluge algorithm. To evaluate the proposed algorithm, we carry out experimental work on two types of examination timetabling datasets. All the related results and analysis obtained illustrate that this hybrid approach is effective when compared with existing approaches in the literature.

[1]  Benjamin Lev,et al.  A branching method for the fixed charge transportation problem , 2010 .

[2]  Edmund K. Burke,et al.  An Extended Great Deluge Approach to the Examination Timetabling Problem , 2009 .

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

[4]  Massimiliano Caramia,et al.  A heuristic approach to long-haul freight transportation with multiple objective functions , 2009 .

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

[6]  Tomás Müller,et al.  ITC2007 solver description: a hybrid approach , 2009, Ann. Oper. Res..

[7]  Kun-Chou Lee,et al.  Array pattern optimization using electromagnetism-like algorithm , 2009 .

[8]  Edmund K. Burke,et al.  Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems , 2009, Eur. J. Oper. Res..

[9]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[10]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[11]  Giuseppe F. Italiano,et al.  Novel Local-Search-Based Approaches to University Examination Timetabling , 2008, INFORMS J. Comput..

[12]  R Nasser,et al.  Solving Examination Timetabling Problems using Honey-bee Mating Optimization (ETP-HBMO) , 2009 .

[13]  Suh-Jenq Yang,et al.  Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities , 2010 .

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

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

[16]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[17]  Edmund K. Burke,et al.  Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems , 2009, J. Oper. Res. Soc..

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

[19]  Reza Tavakkoli-Moghaddam,et al.  Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan , 2010, Knowl. Based Syst..

[20]  N Balakrishnan Examination scheduling: A computerized application , 1991 .

[21]  Wen-Chiung Lee,et al.  A single-machine learning effect scheduling problem with release times , 2010 .

[22]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[23]  Efthymios Housos,et al.  An improved multi-staged algorithmic process for the solution of the examination timetabling problem , 2012, Ann. Oper. Res..

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

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

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

[27]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

[28]  George M. White,et al.  Using tabu search with longer-term memory and relaxation to create examination timetables , 2004, Eur. J. Oper. Res..

[29]  Edmund K. Burke,et al.  Enhancing Timetable Solutions with Local Search Methods , 2002, PATAT.

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

[31]  Sanja Petrovic,et al.  Hybrid variable neighbourhood approaches to university exam timetabling , 2010, Eur. J. Oper. Res..

[32]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[33]  Sevket Ilker Birbil,et al.  Stochastic Global Optimization Techniques , 2002 .

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

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

[36]  Sanja Petrovic,et al.  A time-predefined local search approach to exam timetabling problems , 2004 .

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

[38]  George Goulas,et al.  Pursuit of better results for the examination timetabling problem using grid resources , 2009, 2009 IEEE Symposium on Computational Intelligence in Scheduling.

[39]  Sanja Petrovic,et al.  Case-based heuristic selection for timetabling problems , 2006, J. Sched..

[40]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[41]  Raymond S. K. Kwan Bus and Train Driver Scheduling , 2004, Handbook of Scheduling.

[42]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[43]  James B. Orlin,et al.  Very Large-Scale Neighborhood Search Techniques in Timetabling Problems , 2006, PATAT.

[44]  Kathryn A. Dowsland,et al.  Ant colony optimization for the examination scheduling problem , 2005, J. Oper. Res. Soc..

[45]  R. R. Weitz,et al.  An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling , 1997 .

[46]  D. de Werra,et al.  An introduction to timetabling , 1985 .

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

[48]  Moshe Dror,et al.  A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem , 2007, J. Oper. Res. Soc..

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

[50]  Barry McCollum,et al.  A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling , 2006, PATAT.

[51]  Edmund K. Burke,et al.  A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..

[52]  Alkin Yurtkuran,et al.  A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problems , 2010, Expert Syst. Appl..

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

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

[55]  Sanja Petrovic,et al.  A Novel Similarity Measure for Heuristic Selection in Examination Timetabling , 2004, PATAT.

[56]  Ching-Shih Tsou,et al.  An Electromagnetism-Like Meta-Heuristic for Multi-Objective Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[57]  Victor A. Bardadym Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

[58]  Reza Tavakkoli-Moghaddam,et al.  A novel hybrid approach combining electromagnetism-like method with Solis and Wets local search for continuous optimization problems , 2009, J. Glob. Optim..

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

[60]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[61]  Sigrid Knust,et al.  Sports league scheduling: Graph- and resource-based models , 2007 .

[62]  Moshe Dror,et al.  Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling , 2007, OR Spectr..