Skip to main content
SpringerLink
Log in

Scatter search technique for exam timetabling

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

At universities where students enjoy flexibility in selecting courses, the Registrar’s office aims to generate an appropriate exam timetable for numerous courses and large number of students. An appropriate, real-world exam timetable should show fairness towards all students, respecting the following constraints: (a) eliminating or minimizing the number of simultaneous exams; (b) minimizing the number of consecutive exams; (c) minimizing the number of students with two or three exams per day (d) eliminating the possibility of more than three exams per day (e) exams should fit in rooms with predefined capacity; and (f) the number of exam periods is limited. These constraints are conflicting, which makes exam timetabling intractable. Hence, solving this problem in realistic time requires the use of heuristic approaches. In this work, we develop an evolutionary heuristic technique based on the scatter search approach for finding good suboptimal solutions for exam timetabling. This approach is based on maintaining and evolving a population of solutions. We evaluate our suggested technique on real-world university data and compare our results with the registrar’s manual timetable in addition to the timetables of other heuristic optimization algorithms. The experimental results show that our adapted scatter search technique generates better timetables than those produced by the registrar, manually, and by other meta-heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdullah S, Ahmadi S, Burke EK, Dror M (2007) Investigation Ahuja-Orlins large neighbourhood search for examination timetabling. OR Spectrum 29(2):351–372

    Article  Google Scholar 

  2. Ahmadi S, Barone R, Cheng P, Cowling P, McCollum B (2003) Perturbation based variable neighbourhood search in heuristic space for examination timetabling problem. In: Proceedings of multidisciplinary international scheduling: theory and applications (MISTA 2003), Nottingham, pp 155–171

  3. Asmuni H, Burke EK, Garibaldi JM, McCollum B (2005) Fuzzy multiple heuristic orderings for examination timetabling. In: Burke EK, Trick M (eds) Proceedings of the 5th international conference on the practice and theory of automated timetabling. Lecture notes in computer science, vol 3616. Springer, Berlin, pp 334–353

    Chapter  Google Scholar 

  4. Azimi ZN (2005) Hybrid heuristics for examination timetabling problem. Appl Math Comput 163(2):705–733

    Article  MathSciNet  Google Scholar 

  5. Bilgin B, Ozcan E, Korkmaz EE (2007) An experimental study on hyperheuristics and exam timetabling. In: Burke EK, Rudova H (eds) Practice and theory of automated timetabling: selected papers from the 6th international conference. Lecture notes in computer science, vol 3867. Springer, Berlin, pp 394–412

    Chapter  Google Scholar 

  6. Burke EK, Elliman DG, Ford PH, Weare RF (1996) Examination timetabling in British universities: a survey. In: Burke EK, Ross P (eds) Practice and theory of automated timetabling: selected papers from the 1st international conference. Lecture notes in computer science, vol 1153. Springer, Berlin, pp 76–90

    Google Scholar 

  7. Burke EK, Newall JP (1999) A multi-stage evolutionary algorithm for the timetable problem. IEEE Trans Evol Comput 3(1):63–74

    Article  Google Scholar 

  8. Burke E, Bykov Y, Newall J, Petrovic S (2004) A time-predefined local search approach to exam timetabling problems. IIE Trans Oper Eng 36(6):509–528

    Article  Google Scholar 

  9. Burke EK, Kingston JH, de Werra D (2004) Applications to timetabling. In: Gross J, Yellen J (eds) The handbook of graph theory. Chapman Hall/CRC, London, pp 445–474

    Google Scholar 

  10. Campos V, Glover F, Laguna M, Marti R (2001) An experimental evaluation of a scatter search for the linear ordering problem. J Glob Optim 21:397–414

    Article  MathSciNet  Google Scholar 

  11. Carter MW, Laporte G, Lee SY (1996) Examination timetabling: algorithmic strategies and applications. J Oper Res Soc 47(3):373–383

    Google Scholar 

  12. Carter M, Johnson DG (2001) Extended clique initialization in examination timetabling. J Oper Res Soc 52(5):538–544

    Article  Google Scholar 

  13. Cheong CY, Tan KC, Veeravalli B (2009) A multi-objective evolutionary algorithm for examination timetabling. J Sched 12:121–146

    Article  Google Scholar 

  14. Cooper TB, Kingston JH (1996) The complexity of timetable construction problems. In: Burke EK, Ross P (eds) Practice and theory of automated timetabling: selected papers from the 1st international conference. Lecture notes in computer science, vol 1153. Springer, Berlin, pp 283–295

    Google Scholar 

  15. Côté P, Wong T, Sabourin R (2005) Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. In: Burke E, Trick M (eds) Proceedings of the 5th international conference on the practice and theory of automated timetabling. Lecture notes in computer science, vol 3616. Springer, Berlin, pp 294–312

    Chapter  Google Scholar 

  16. Di Gaspero L, Schaerf A (2000) Tabu search techniques for examination timetabling. In: Proceedings of the 3rd international conference on the practice and theory of automated timetabling, Germany, pp 176–179

  17. Dowsland KA, Thompson J (2005) Ant colony optimization for the examination scheduling problem. J Oper Res Soc 56:426–438

    Article  Google Scholar 

  18. Glover F (1998) A template for scatter search and path relinking. In: Hao JK, Lutton E, Ronald E, Schoenauer M, Snyers D (eds) Artificial evolution. Lecture notes in computer science, vol 1363. Springer, Berlin, pp 13–54

    Chapter  Google Scholar 

  19. Glover F, Laguna M, Martí R (2000) Fundamentals of scatter search and path relinking. Control Cybern 29(3):653–684

    Google Scholar 

  20. Glover F, Laguna M, Martí R (2002) Scatter search. In: Ghosh A. Tsutsui S (eds) Theory and applications of evolutionary computation: recent trends. Springer, Berlin, pp 519–529

    Google Scholar 

  21. Glover F, Laguna M, Martí R (2003) Scatter search and path relinking: advances and applications. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic, Dordrecht, pp 1–36

    Google Scholar 

  22. Kendall G, Mohd Hussin N (2005) A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA university of technology. In: Burke E, Trick M (eds) Proceedings of the 5th international conference on the practice and theory of automated timetabling. Lecture notes in computer science, vol 3616. Springer, Berlin, pp 270–293

    Chapter  Google Scholar 

  23. Laguna M, Martí R (2003) Scatter search methodology and implementations in C. Kluwer Academic, Dordrecht

    Google Scholar 

  24. Laguna M, Armentano VA (2005) Lessons from applying and experimenting with scatter search. In: Sharda R, Voß S, Rego C, Alidaee B (eds) Metaheuristic optimization via memory and evolution tabu search and scatter search. Springer, Berlin, pp 229–246

    Chapter  Google Scholar 

  25. Lotfi V, Cerveny R (1991) A final-exam-scheduling package. J Oper Res Soc 42:205–216

    Google Scholar 

  26. Malim MR, Khader AT, Mustafa A (2006) Artificial immune algorithms for university timetabling. In: Burke EK, Rudova H (eds) Proceedings of the 6th international conference on practice and theory of automated timetabling, Brno, Czech Republic, pp 234–245

  27. Mansour N, Tarhini A, Ishakian V (2003) Three-phase simulated annealing algorithms for exam scheduling. In: Proceedings of the 2nd ACS/IEEE international conference on computer systems and applications, Tunis

  28. Mansour N, Timani M (2007) Stochastic search algorithms for exam scheduling. Int J Comput Intell Res 3(4):353–361

    Google Scholar 

  29. Martí R, Laguna M, Campos V (2005) Scatter search vs. genetic algorithms: an experimental evaluation with permutation problems. In: Rego C, Alidaee B (eds) Metaheuristic optimization via adaptive memory and evolution: tabu search and scatter search. Kluwer Academic, Dordrecht, pp 263–282

    Chapter  Google Scholar 

  30. McCollum B (2007) A perspective on bridging the gap between research and practice in university timetabling. In: Burke EK, Rudova H (eds) Proceedings of the 6th international conference on the practice and theory of automated timetabling. Lecture notes in computer science, vol 3867. Springer, Berlin, pp 3–23

    Chapter  Google Scholar 

  31. McCollum B, Schaerf A, Paechter B, McMullan P, Lewis R, Parkes A, Di Gaspero L, Qu R, Burke E (2009) Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS J Comput (accepted)

  32. Merlot LTG, Boland N, Hughes BD, Stuckey PJ (2003) A hybrid algorithm for the examination timetabling problem. In: Burke EK, Causmaecker PD (eds) Proceedings of the 4th international conference on the practice and theory of automated timetabling. Lecture notes in computer science, vol 2740. Springer, Berlin, pp 207–231

    Chapter  Google Scholar 

  33. Muller T (2008) ITC2007: solver description. In: Proceedings of the 7th international conference on the practice and theory of automated timetabling, Montréal

  34. Petrovic S, Bykov Y (2003) A multiobjective optimisation technique for exam timetabling based on trajectories. In: Burke EK, Causmaecker PD (eds) Proceedings of the 4th international conference on the practice and theory of automated timetabling. Lecture notes in computer science, vol 2740. Springer, Berlin, pp 179–192

    Google Scholar 

  35. Pillay N, Banzhaf W (2009) A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem. Eur J Oper Res 197(2):482–491

    Article  Google Scholar 

  36. Qu R, Burke EK (2009) Hybridisation within a graph based hyperheuristic framework for university timetabling problems. J Oper Res Soc 60:1273–1285

    Article  Google Scholar 

  37. Qu R, Burke EK, McCollum B, Merlot LTG, Lee SY (2009) A survey of search methodologies and automated system development for examination timetabling. J Sched 12:55–89

    Article  MathSciNet  Google Scholar 

  38. Reis LP, Oliveira E (2001) A language for specifying complete timetabling problems. In: Burke EK, Erben W (eds) Practice and theory of automated timetabling: selected papers from the 3rd international conference. Lecture notes in computer science, vol 2079. Springer, Berlin, pp 322–341

    Chapter  Google Scholar 

  39. Ross P, Marin-Blazquez JG, Hart E (2004) Hyper-heuristics applied to class and exam timetabling problems. In: Proceedings of the 2004 congress on evolutionary computation, pp 1691–1698

  40. Schaerf A (1999) A survey of automated timetabling. Artif Intell Rev 13(2):87–127

    Article  Google Scholar 

  41. Terashima-Marin H, Ross P, Valenzuela-Rendon M (1999) Clique-based crossover for solving the timetabling problem with GAs. In: Schoenauer M et al (eds) Proceedings of CEC’99 conference. IEEE Press, Washington, pp 1200–1206

    Google Scholar 

  42. Thompson J, Dowsland K (1998) A robust simulated annealing based examination timetabling system. Comput Oper Res 25:637–648

    Article  Google Scholar 

  43. Ulker O, Ozcan E, Korkmaz EE (2007) Linear linkage encoding in grouping problems: applications on graph coloring and timetabling. In: Burke EK, Rudova H (eds) Practice and theory automated timetabling: selected papers from the 6th international conference. Lecture notes in computer science, vol 3867. Springer, Berlin, pp 347–363

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon

    Nashat Mansour, Vatche Isahakian & Iman Ghalayini

  2. Dept. of Computer Science, Boston University, Boston, MA, USA

    Vatche Isahakian

Authors
  1. Nashat Mansour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vatche Isahakian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Iman Ghalayini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nashat Mansour.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mansour, N., Isahakian, V. & Ghalayini, I. Scatter search technique for exam timetabling. Appl Intell 34, 299–310 (2011). https://doi.org/10.1007/s10489-009-0196-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-009-0196-5

Keywords

Search

Navigation