107
Views
14
CrossRef citations to date
0
Altmetric
General Paper

A great deluge algorithm for a real-world examination timetabling problem

&
Pages 116-133 | Received 01 Mar 2011, Accepted 01 Nov 2012, Published online: 21 Dec 2017

References

  • Abdullah S (2006). Heuristic approaches for university timetabling problems. PhD Thesis, School of Computer Science and Information Technology, University of Nottingham, June 2006.
  • Abdullah S, Burke EK and McCollum B (2005). An investigation of variable neighbourhood search for university course timetabling. In: Proceedings of MISTA 2005: The 2nd Multidisciplinary Conference on Scheduling: Theory and Applications. 18–21 July, pp 413–427.
  • Abdullah S, Shaker K, McCollum B and McMullan P (2009a). Construction of course timetables based on great Deluge and Tabu search. In: Proceedings of MIC 2009: VIII Metaheuristic International Conference, 13–16 July, Hamburg, Germany.
  • Abdullah S, Turabieh H and McCollum B (2009b). A tabu-based memetic approach for examination timetabling problems. In: AI-2009 Twenty-ninth SGAI International Conference on Artificial Intelligence, 15–17 December, Cambridge, England.
  • Burke EK and Bykov Y (2008). A late acceptance strategy in hill-climbing for exam timetabling problems. In: Proceeding PATAT’08: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, 19–22 August, Universit de Montral, Montreal, Canada.
  • Burke EK and Carter MW (eds) (1998). Second International Conference on Practice and Theory of Automated Timetabling II, PATAT ’97. Toronto, Canada, 20–22 August, Selected Papers. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag: Berlin Heidelberg.
  • Burke EK and De Causmaecker P (eds) (2003). Fourth International Conference on Practice and Theory of Automated Timetabling IV, (PATAT 2002). Gent, Belgium, 21–23 August 2002, Selected Revised Papers. Lecture Notes in Computer Science, Vol. 2740. Springer-Verlag: Berlin Heidelberg.
  • Burke EK and Erben W (eds) (2001). Third International Conference on Practice and Theory of Automated Timetabling III, (PATAT 2000). Konstanz, Germany, 16–18 August 2000, Selected Papers. Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag: Berlin Heidelberg.
  • BurkeEKKendallGSearch Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques2005
  • Burke EK and Newall J (2003). Enhancing timetable solutions with local search methods. In: Burke EK and De Causmaecker P (eds). Selected Papers from the 4th International Conference on Practice and Theory of Automated Timetabling (PATAT 2002). Gent, Belgium, 21–23 August 2002. Lecture Notes in Computer Science, Vol. 2740. 2740, Springer-Verlag, Berlin Heidelberg, pp. 195–206.
  • Burke EK and Ross P (eds) (1996). First International Conference on Practice and Theory of Automated Timetabling. Edinburgh, UK, 29 August – 1 September 1995, Selected Papers. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag: Berlin Heidelberg.
  • BurkeEKRudovaHSixth International Conference on Practice and Theory of Automated Timetabling VI, (PATAT 2006)2007
  • Burke EK and Trick M (eds) (2005). Fifth International Conference on Practice and Theory of Automated Timetabling V, (PATAT 2004). Pittsburgh, PA, USA, 18–20 August 2004, Revised Selected Papers. Lecture Notes in Computer Science, Vol. 3616. Springer-Verlag: Berlin Heidelberg.
  • BurkeEKNewallJWeareRFA memetic algorithm for university exam timetablingSelected Papers from the First International Conference on Practice and Theory of Automated Timetabling1996241250
  • BurkeEKEllimanDGFordPHWeareRFExamination timetabling in British universities – A surveySelected Papers from First International Conference on the Practice and Theory of Automated Timetabling19967692
  • Burke EK, Eckersley A, McCollum B, Petrovic S and Qu R (2003). Using simulated annealing to study behaviour of various exam timetabling data sets. In: Proceedings of Metaheuristic International Conference 2003 (MIC 2003), 25–28 August, Kyoto, Japan.
  • BurkeEKBykovYNewallJPPetrovicSA time-predefined local search approach to exam timetabling problemsIIE Transactions200436650952810.1080/07408170490438410
  • BurkeEKMcCollumBMeiselsAPetrovicSQuRA graph-based hyper-heuristic for educational timetabling problemsEuropean Journal of Operational Research2007176117719210.1016/j.ejor.2005.08.012
  • BurkeEKEckersleyAJMcCollumBPetrovicSQuRHybrid variable neighbourhood approaches to university exam timetablingEuropean Journal of Operational Research20102061465310.1016/j.ejor.2010.01.044
  • Burke EK, Hyde M, Kendall G, Ochoa G, Ozcan E and Qu R (2010b). Hyper-heuristics: A survey of the state of the art, School of Computer Science and Information Technology. University of Nottingham, Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747.
  • CarterMWLaporteGRecent developments in practical examination timetablingSelected Papers from the First International Conference on the Practice and Theory of Automated Timetabling (PATAT I)1996321
  • CarterMWLaporteGLeeSYExamination timetabling: Algorithmic strategies and applicationsJournal of Operational Research Society199647337338310.1057/jors.1996.37
  • Cowling P, Kendall G and Hussin NM (2002). A survey and case study of practical examination timetabling problems. In: Proceedings of the 4th international Conference on the Practice and Theory of Automated Timetabling (PATAT 2002). Gent, Belgium, 21–23 August, pp 258–261.
  • Di GasperoLSchaerfATabu search techniques for examination timetablingSelected Papers from the Third International Conference on Practice and Theory of Automated Timetabling2001104117
  • DorigoMManiezzoVColorniAAnt System: Optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics-Part B1996261294110.1109/3477.484436
  • DueckGNew optimization heuristics: The great deluge algorithm and the record-to-record travelJournal of Computational Physics19931041869210.1006/jcph.1993.1010
  • Eley M (2006). Some experiments with ant colony algorithms for the exam timetabling problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 4150, LNCS, pp 492–499.
  • Eley M (2007). Ant algorithms for the exam timetabling problem. In: Burke EK and Rudova H (eds). Selected Papers from the 6th International Conference on Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, 30 August–1 September, Vol. 3867, Springer-Verlag: Berlin Heidelberg, pp 364–382.
  • GloverFFuture paths for integer programming and links to artificial intelligenceComputers and Operations Research198613553354910.1016/0305-0548(86)90048-1
  • HansenPMladenovicNAn introduction to variable neighborhood searchMeta-Heuristics 98: Theory & Applications1999433458
  • Hussin NM (2005). Tabu search based hyper-heuristic approaches to examination timetabling. PhD Thesis, University of Nottingham, UK.
  • KaharMNMKendallGThe examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solutionEuropean Journal of Operational Research2010207255756510.1016/j.ejor.2010.04.011
  • Kendall G and Hussin MN (2004). Tabu search hyper-heuristic approach to the examination timetabling problem at University Technology Mara. In: Burke EK and Trick M (eds). Proceedings of the Fifth International Conference on the Practice and Theory of Automated Timetabling (PATAT V). Pittsburgh, USA, 18–20 August, Vol. 3616. Springer-Verlag: Berlin Heidelberg, pp 199–217.
  • KirkpatrickSGelattCDJrVecchiMPOptimization by simulated annealingScience1983220459867168010.1126/science.220.4598.671
  • McCollumBA perspective on bridging the gap between theory and practice in university timetablingSelected Papers from the Sixth International Conference on Practice and Theory of Automated Timetabling2007386732310.1007/978-3-540-77345-0_1
  • McCollumBSetting the research agenda in automated timetabling: The second international timetabling competitionINFORMS Journal on Computing201022112013010.1287/ijoc.1090.0320
  • McMullan P (2007). An extended implementation of the great deluge algorithm for course timetabling. Lecture Notes in Computer Science, Vol. 4487. Springer, pp 538–545.
  • MerlotLTGBolandNHughesBDStuckeyPJA hybrid algorithm for the examination timetabling problemSelected Papers from Fourth International Conference on Practice and Theory of Automated Timetabling IV2003207231
  • PetrovicSBurkeEKHandbook of Scheduling: Algorithms, Models, and Performance Analysis2004
  • PillayNBanzhafWA study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problemEuropean Journal of Operational Research2009197248249110.1016/j.ejor.2008.07.023
  • QuRBurkeEKMcCollumBMerlotLTGLeeSYA survey of search methodologies and automated system development for examination timetablingJournal of Scheduling2009121558910.1007/s10951-008-0077-5
  • RossPCorneDComparing genetic algorithms, simulated annealing, and stochastic hillclimbing on timetabling problemsEvolutionary Computing 2199594102
  • SchaerfAA survey of automated timetablingArtificial Intelligence Review19991328712710.1023/A:1006576209967
  • Silva DL and Obit JH (2008). Great deluge with non-linear decay rate for solving course timetabling problems. Intelligent Systems (IS'08). 4th International IEEE Conference, Varna, Vol. 1, 6–8 September pp 8–11, 8–18.
  • ThompsonJMDowslandKAA robust simulated annealing based examination timetabling systemComputers & Operations Research1998257–863764810.1016/S0305-0548(97)00101-9
  • WhiteGMXieBSZonjicSUsing tabu search with longer-term memory and relaxation to create examination timetablesEuropean Journal of Operational Research20041531809110.1016/S0377-2217(03)00100-0

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.