Abstract
In this paper we have presented a combination of two meta-heuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order to obtain a feasible solution and satisfying as many as of the soft constraints as possible. The algorithm is tested over two databases: eleven enrolment-based benchmark datasets (representing one large, five medium and five small problems) and curriculum-based datasets used and developed from the International Timetabling Competition, ITC2007 (UD2 problems). A new strategy has been introduced to control the application of a set of neighbourhood structures using the tabu search and great deluge. The results demonstrate that our approach is able to produce solutions that have lower penalties on all the small and medium problems in eleven enrolment-based datasets and can produce solutions with comparable results on the curriculum-based datasets (with lower penalties on several data instances) when compared against other techniques from the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdullah, S., Shaker, K., McCollum, B., McMullan, P.: Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 1–10. Springer, Heidelberg (2010a)
Abdullah, S., Shaker, K., McCollum, B., McMullan, P.: Incorporating Great Deluge with Kempe Chain Neighbourhood Structure for the Enrolment-Based Course Timetabling Problem. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds.) RSKT 2010. LNCS, vol. 6401, pp. 70–77. Springer, Heidelberg (2010b)
Abdullah, S., Turabieh, H.: Generating university course timetable using genetic algorithms and local search. In: The Third International Conference on Convergence and Hybrid Information Technology, ICCIT, vol. I, pp. 254–260 (2008)
Al-Betar, M., Khader, A.: A harmony search algorithm for university course timetabling. Annals of Operations Research 194(1), 3–31 (2012), doi:10.1007/s10479-010-0769-z
Bellio, R., Di Gaspero, L., Schaerf, A.: Design and statistical analysis of a hybrid local search algorithm for course timetabling. Journal of Scheduling, 1–13 (2011)
Burke, E., Kendall, G.: Search methodologies: introductory tutorials in optimization and decision support techniques. Springer (2005)
Burke, E., Marecek, J., Parkes, A., Rudová, H.: Decomposition, reformulation, and diving in university course timetabling. Computers & Operations Research 37(3), 582–597 (2010)
Clark, M., Henz, M., Love, B.: QuikFix A Repair-based Timetable Solver. In: Proceedings of the 7th PATAT Conference, Burke, Gendreau (2008)
De Cesco, F., Di Gaspero, L., Schaerf, A.: Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In: Proceedings of the 7th PATAT Conference (2008)
Di Gaspero, L., McCollum, B., Schaerf, A.: The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). In: The 14th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (2007)
Dueck, G.: New optimization heuristics. Journal of Computational Physics 104(1), 86–92 (1993)
Geiger, M.: An application of the Threshold Accepting metaheuristic for curriculum based course timetabling. In: Proceedings of the 7th PATAT Conference (2008)
Glover: Tabu Search. Kluwer Academic, Boston (1997)
Landa-Silva, D., Obit, J.: Great deluge with non-linear decay rate for solving course timetabling problems. In: Proceedings of the 2008 IEEE Conference on Intelligent Systems (IS 2008), pp. 8.11–8.18. IEEE Press (2008)
Lü, Z., Hao, J.: Adaptive tabu search for course timetabling. European Journal of Operational Research 200(1), 235–244 (2010)
McMullan, P.: An extended implementation of the great deluge algorithm for course timetabling. In: Computational Science–ICCS 2007, pp. 538–545 (2007)
Socha, K., Knowles, J., Sampels, M.: A max-min ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, p. 1. Springer, Heidelberg (2002)
Turabieh, H., Abdullah, S., McCollum, B.: Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS (LNAI), vol. 5589, pp. 497–504. Springer, Heidelberg (2009)
Obit, J., Landa-Silva, D., Ouelhadj, D., Sevaux, M.: Non-linear great deluge with learning mechanism for solving the course timetabling problem. In: Proc. 8th Metaheuristics Int. Conf., p. 10 (2009)
Al-Betar, M.A., Khader, A.T.A., Liao, I.Y.: A Harmony Search with Multi-pitch Adjusting Rate for the University Course Timetabling. In: Geem, Z.W. (ed.) Recent Advances In Harmony Search Algorithm. SCI, vol. 270, pp. 147–161. Springer, Heidelberg (2010)
Ayob, M., Jaradat, G.: Hybrid ant colony systems for course timetabling problems. In: Proc. 2nd Conf. Data Mining Optimization, October 27-28, pp. 120–126 (2009)
Müller, T.: ITC2007 solver description: a hybrid approach. Annals of Operations Research 172(1), 429–446 (2009)
Burke, E.K., Mareček, J., Parkes, A.J., Rudová, H.: A branch-and-cut procedure for the Udine course timetabling problem. Annals of Operations Research, 1–17 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shaker, K., Abdullah, S., Alqudsi, A., Jalab, H. (2013). Hybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems. In: Lingras, P., Wolski, M., Cornelis, C., Mitra, S., Wasilewski, P. (eds) Rough Sets and Knowledge Technology. RSKT 2013. Lecture Notes in Computer Science(), vol 8171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41299-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-41299-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41298-1
Online ISBN: 978-3-642-41299-8
eBook Packages: Computer ScienceComputer Science (R0)