An Adaptive Flex-Deluge Approach to University Exam Timetabling

Published Online:https://doi.org/10.1287/ijoc.2015.0680

References

  • Abdullah S, Alzaqebah M (2014) An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling. J. Scheduling 17:249–262.CrossrefGoogle Scholar
  • Abdullah S, Ahmadi S, Burke EK, Dror M (2007) Investigating Ahuja-Orlin’s large neighbourhood search for examination timetabling. OR Spectrum 29:351–372.CrossrefGoogle Scholar
  • Abdul Rahman S, Bargiela A, Burke EK, Ozcan E, McCollum B, McMullan P (2014) Adaptive linear combination of heuristic ordering in constructing examination timetables. Eur. J. Oper. Res. 232:287–297.CrossrefGoogle Scholar
  • Al-Betar MA, Khader AT, Abu Doush I (2014) Memetic techniques for examination timetabling. Ann. Oper. Res. 218:23–50.CrossrefGoogle Scholar
  • Asmuni H, Burke EK, Garibaldi J, McCollum B, Parkes A (2009) An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. Comput. Oper. Res. 36:981–1001.CrossrefGoogle Scholar
  • Bardadym V (1996) Computer-aided school and university timetabling: The new wave. Burke EK, Ross P, eds. Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153 (Springer-Verlag, Berlin), 22–45.CrossrefGoogle Scholar
  • Burke EK, Bykov Y (2006) Solving exam timetabling problems with the flex-deluge algorithm (abstract). PATAT 2006 Proc. 6th Internat. Conf. Practice Theory Automated Timetabling, Montreal, 370–372.Google Scholar
  • Burke EK, Newall J (2003) Enhancing timetable solutions with local search methods. Burke EK, De Causmaecker P, eds. Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740 (Springer, Berlin), 344–354.CrossrefGoogle Scholar
  • Burke EK, Newall J (2004) Solving examination timetabling problems through adaptation of heuristic orderings. Ann. Oper. Res. 129:107–134.CrossrefGoogle Scholar
  • Burke EK, Petrovic S (2002) Recent research directions in automated timetabling. Eur. J. Oper. Res. 140:266–280.CrossrefGoogle Scholar
  • Burke EK, Kingston J, De Werra D (2004b) 5,6: Application to timetabling. Gross J, Yellen J, eds. The Handbook of Graph Theory (Chapman Hall/CRC Press, Boca Raton, FL), 445–474.Google Scholar
  • Burke EK, Petrovic S, Qu R (2006) Case based heuristic selection for timetabling problems. J. Scheduling 9:115–132.CrossrefGoogle Scholar
  • Burke EK, Bykov Y, Newall J, Petrovic S (2003) A time-predefined approach to course timetabling. Yugoslav J. Oper. Res. (YUJOR) 13:139–151.CrossrefGoogle Scholar
  • Burke EK, Bykov Y, Newall J, Petrovic S (2004a) A time-predefined local search approach to exam timetabling problems. IIE Trans. 36:509–528.CrossrefGoogle Scholar
  • Burke EK, Elliman D, Ford P, Weare R (1996) Examination timetabling in British universities: A survey. Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153 (Springer, Berlin), 76–90.CrossrefGoogle Scholar
  • Burke EK, Kingston J, Jackson K, Weare R (1997) Automated university timetabling: The state of the art. Comput. J. 40:565–571.CrossrefGoogle Scholar
  • Burke EK, Eckersley A, McCollum B, Petrovic S, Qu R (2010) Hybrid variable neighbourhood approaches to university exam timetabling. Eur. J. Oper. Res. 206:46–53.CrossrefGoogle Scholar
  • Burke EK, McColumn B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur. J. Oper. Res. 176:177–192.CrossrefGoogle Scholar
  • Bykov Y (2003) Time-predefined and trajectory based search: Single and multiobjective approaches to exam timetabling. PhD thesis, The University of Nottingham, Nottingham, UK.Google Scholar
  • Caramia M, Dell’Olmo P, Italiano GF (2008) Novel local-search-based approaches to university examination timetabling. INFORMS J. Comput. 20:86–99.LinkGoogle Scholar
  • Carter MW (1986) A survey of practical applications of examination timetabling algorithms. Oper. Res. 34:193–202.LinkGoogle Scholar
  • Carter MW, Laporte G (1996) Recent developments in practical examination timetabling. Burke EK, Ross P, eds. Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153 (Springer, Berlin), 3–21.CrossrefGoogle Scholar
  • Carter MW, Laporte G, Lee S (1996) Examination timetabling: Algorithmic strategies and applications. J. Oper. Res. Soc. 47:373–383.CrossrefGoogle Scholar
  • Casey S, Thompson J (2003) GRASPing the examination scheduling problem. Burke EK, De Causmaecker P, eds. Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740 (Springer, Berlin), 232–246.CrossrefGoogle Scholar
  • Cheong CY, Tan KC, Veeravalli B (2009) A multi-objective evolutionary algorithm for examination timetabling. J. Scheduling 12:121–146.CrossrefGoogle Scholar
  • Corne D, Ross P (1996) Peckish initialisation strategies for evolutionary timetabling. Burke EK, Ross P, eds. Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153 (Springer, Berlin), 227–240.CrossrefGoogle Scholar
  • David P (1998) A constraint-based approach for examination timetabling using local repair techniques. Burke EK, Carter M, eds. Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science, Vol. 1408 (Springer, Berlin), 169–186.CrossrefGoogle Scholar
  • de Werra D (1985) An introduction to timetabling. Eur. J. Oper. Res. 19:151–162.CrossrefGoogle Scholar
  • Di Gaspero L (2002) Recolour, shake and kick: A recipe for the examination timetabling problem (abstract). PATAT 2002 Proc. 4th Internat. Conf. Practice Theory Automated Timetabling, Gent, Belgium, 404–407.Google Scholar
  • Di Gaspero L, Schaerf A (2001) Tabu search techniques for examination timetabling. Burke EK, Erben W, eds. Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science, Vol. 2079 (Springer, Berlin), 104–117.CrossrefGoogle Scholar
  • Dueck G (1993) New optimisation heuristics. The great deluge algorithm and record-to-record travel. J. Comput. Phys. 104:86–92.CrossrefGoogle Scholar
  • Erben W (2001) A grouping genetic algorithm for graph colouring and exam timetabling. Burke EK, Erben W, eds. Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science, Vol. 2079 (Springer, Berlin), 132–156.CrossrefGoogle Scholar
  • Fong CW, Asmuni H, McCollum B, McMullan P, Omatu S (2014) A new imperialist swarm-based optimization algorithm for university timetabling problems. Inform. Sci. 283:1–21.CrossrefGoogle Scholar
  • Gogos C, Alefragis P, Housos E (2008) A multi-staged algorithmic process for the solution of the examination timetabling problem. PATAT 2008 Proc. 7th Internat. Conf. Practice Theory Automated Timetabling, Montreal, Canada.Google Scholar
  • Gogos C, Goulas G, Alefragis P, Kolonias V, Housos E (2010) Distributed scatter search for the examination timetabling problem. PATAT 2010 Proc. 8th Internat. Conf. Practice Theory Automated Timetabling, Belfast, Ireland.Google Scholar
  • Jaddi NS, Abdullah S (2013) Nonlinear great deluge algorithm for rough set attribute reduction. J. Inform. Sci. Engrg. 29:49–62.Google Scholar
  • Lewis R (2008) A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30:167–190.CrossrefGoogle Scholar
  • McCollum B (2007) A perspective on bridging the gap between theory and practice in university timetabling. Burke EK, Rudova H, eds. Practice and Theory of Automated Timetabling VI, Lecture Notes in Computer Science, Vol. 3867 (Springer, Berlin), 3–23.CrossrefGoogle Scholar
  • McCollum B, McMullan PJ, Parkes AJ, Burke EK, Abdullah S (2009) An extended great deluge approach to the examination timetabling problem. MISTA09. Proc. 4th Multidisciplinary Internat. Conf. Scheduling: Theory Appl., Dublin, Ireland, 424–434.Google Scholar
  • McCollum B, Schaerf A, Paechter B, McMullan PJ, Lewis R, Parkes AJ, Di Gaspero L, Qu R, Burke EK (2010) Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS J. Comput. 22:120–130.LinkGoogle Scholar
  • McMullan P (2007) An extended implementation of the great deluge algorithm for course timetabling. Shi Y, van Albada GD, Dongarra J, Sloot PMA, eds. Computational Science—ICCS 2007, Lecture Notes in Computer Science, Vol. 4487 (Springer-Verlag, Berlin), 538–545.CrossrefGoogle Scholar
  • Merlot L, Boland N, Hughes B, Stuckey P (2003) A hybrid algorithm for the examination timetabling problem. Burke EK, De Causmaecker P, eds. Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740 (Springer, Berlin), 207–231.CrossrefGoogle Scholar
  • Meyers C, Orlin JB (2007) Very large scale neighbourhood search techniques in timetabling problems. Burke EK, Rudova H, eds. Practice and Theory of Automated Timetabling VI, Lecture Notes in Computer Science, Vol. 3867 (Springer, Berlin), 24–39.CrossrefGoogle Scholar
  • Muller T (2008) ITC2007 solver description: A hybrid approach. PATAT 2008 Proc. 7th Internat. Conf. Practice Theory Automated Timetabling, Montreal, Canada.Google Scholar
  • Obit JH, Landa-Silva D, Ouelhadj D, Sevaux M (2009) Non-linear great deluge with learning mechanism for solving the course timetabling problem. Proc. MIC 2009: The VIII Metaheuristic Internat. Conf., Hamburg, Germany.Google Scholar
  • Ozcan E, Birben M, Bykov Y, Burke EK (2009) Examination timetabling using late acceptance hyper-heuristics. CEC 2009 Proc. 2009 IEEE Congress on Evolutionary Comput., Trondheim, Norway, 997–1004.CrossrefGoogle Scholar
  • Ozcan E, Misir M, Ochoa G, Burke EK (2010) A reinforcement learning—great deluge hyper-heuristic for examination timetabling. Internat. J. Appl. Metaheuristic Comput. 1:39–59.CrossrefGoogle Scholar
  • Paquete LF, Fonseca CM (2001) A study of examination timetabling with multiobjective evolutionary algorithms. 4th Metaheuristics Internat. Conf. (MIC 2001), Porto, Portugal, 149–154.Google Scholar
  • Petrovic S, Burke EK (2004) University timetabling. Leung JY-T, ed. Handbook of Scheduling: Algorithms, Models, and Performance Analysis (CRC Press, Boca Raton, FL), 45.1–45.34.Google Scholar
  • Petrovic S, Bykov Y (2003) A multiobjective optimisation technique for exam timetabling based on trajectories. Burke EK, De Causmaecker P, eds. Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740 (Springer, Berlin), 179–192.CrossrefGoogle Scholar
  • Petrovic S, Patel V, Yang Y (2004) Examination timetabling with fuzzy constraints. Burke EK, Trick M, eds. Practice and Theory of Automated Timetabling, V, Lecture Notes in Computer Science, Vol. 3616 (Springer-Verlag, Berlin), 313–333.Google Scholar
  • Petrovic S, Yang Y, Dror M (2007) Case-based selection of initialisation heuristics for metaheuristic examination timetabling. Expert Systems Appl. 33:772–785.CrossrefGoogle Scholar
  • Pillay N (2009) The revised developmental approach to the uncapacitated examination timetabling problem. 2009 Ann. Res. Conf. South African Inst. Comput. Scientists Inform. Technologists, Vanderbijlpark, South Africa, 187–192.CrossrefGoogle Scholar
  • Pillay N (2016) A review of hyper-heuristics for educational timetabling. Ann. Oper. Res. 239:3–38.CrossrefGoogle Scholar
  • Qu R, Burke EK, McCollum B, Merlot LTG, Lee SY (2009) A survey of search methodologies and automated system development for examination timetabling. J. Scheduling 12:55–89.CrossrefGoogle Scholar
  • Schaerf A (1999) A survey of automated timetabling. Artificial Intelligence Rev. 13:87–127.CrossrefGoogle Scholar
  • Sin ES, Kham NSM (2012) Hyper heuristic based on great deluge and its variants for exam timetabling problem. Internat. J. Artificial Intelligence Appl. 3:149–162.Google Scholar
  • Thompson JM, Dowsland KA (1996a) General cooling schedules for simulated annealing based timetabling system. Burke EK, Ross P, eds. Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153 (Springer, Berlin), 345–363.CrossrefGoogle Scholar
  • Thompson JM, Dowsland KA (1996b) Variants of simulated annealing for the examination timetabling problem. Ann. Oper. Res. 63:105–128.CrossrefGoogle Scholar
  • Turabeih H, Abdullah S (2011) A hybrid fish swarm optimisation algorithm for solving examination timetabling problem. Coello Coello CA, ed. Learning and Intelligent Optimization, Lecture Notes in Computer Science, Vol. 6683 (Springer, Berlin), 539–551.CrossrefGoogle Scholar
  • Ulker O, Ozcan E, Korkmaz EE (2007) Linear linkage encoding in grouping problems: Applications on graph coloring and timetabling. Burke EK, Rudova H, eds. Practice and Theory of Automated Timetabling VI, Lecture Notes in Computer Science, Vol. 3867 (Springer, Berlin), 347–363.CrossrefGoogle Scholar
  • White GM, Xie BS (2001) Examination timetables and tabu search with longer term memory. Burke EK, Erben W, eds. Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science, Vol. 2079 (Springer, Berlin), 85–103.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.