Abstract
The university course timetabling problem (CTTP) involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraint. The objective is to satisfy the hard constraints (essential requirements) and minimise the violation of soft constraints (desirable requirements). In this study, we apply three algorithms to the CTTP problem: Great Deluge, Simulated Annealing and Hill Climbing. We use a Round Robin Scheduling Algorithm (RR) as a strategy to control the application of these three algorithms. The performance of our approach is tested over eleven benchmark datasets: one large, five medium and five small problems. Competitive results have been obtained when compared with other state-of-the-art techniques.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdullah, S., Burke, E.K., McCollum, B.: A hybrid evolutionary approach to the university course timetabling problem. IEEE Congres on Evolutionary Computation, 1764–1768 (2007) ISBN: 1-4244-1340-0
Abdullah, S., Burke, E.K., McCollum, B.: An investigation of variable neighbourhood search for university course timetabling. In: The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pp. 413–427 (2005)
Abdullah, S., Burke, E.K., McCollum, B.: Using a randomised iterative improvement algorithm with composite neighbourhood structures for university course timetabling. In: Metaheuristics: Progress in complex systems optimisation. Operations Research/Computer Science Interfaces Series, ch. 8, Springer, Heidelberg (2007) ISBN:978-0-387-71919-1
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 (2010)
Abdullah, S., Turabieh, H.: Generating university course timetable using genetic algorithms and local search. In: The Third 2008 International Conference on Convergence and Hybrid Information Technology ICCIT, vol, pp. 254–260 (2008)
Al-Betar, M., Khader, A., Yi Liao, I.: 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 270, pp. 147–161. Springer, Heidelberg (2010)
McCollum, B., Burke, E.K., McMullan, P.: A review and description of datasets, formulations and solutions to the University Course Timetabling Problem, April 2009. To be submitted to the Journal of Scheduling (2009)
Burke, E.K., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for timetabling problems. European Journal of Operational Research 176, 177–192 (2007)
Landa-Silva, D., Obit, J.H.: Great deluge with non-linear decay rate for solving course timetabling problem. In: The Fourth International IEEE conference on Intelligent Systems, Varna, Bulgaria (2008)
Lu, Z., Hao, J.: Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm. In: Dochev, D., Pistore, M., Traverso, P. (eds.) AIMSA 2008. LNCS (LNAI), vol. 5253, pp. 262–273. Springer, Heidelberg (2008)
McMullan, P.: An extended implementation of the great deluge algorithm for course timetabling. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 538–545. Springer, Heidelberg (2007)
Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G., Lee, S.Y.: A Survey of Search Methodologies and Automated System Development for Examination Timetabling. Journal of Scheduling 12(1), 55–89 (2009)
Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30(1), 167–190 (2008)
Schaerf, A.: A Survey of Automated Timetabling. Artif. Intelli. Rev. 13, 87–127 (1999)
Socha, K., Knowles, J., Samples, M.: A max-min ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 1–13. 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, vol. 5589, pp. 497–504. Springer, Heidelberg (2009)
Ross, P., Corne, D.: Comparing genetic algorithm simulated annealing and stochastic hill climbing of timetabling problems. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 94–102. Springer, Heidelberg (1995)
Lewis, R., Paechter, B.: New crossover operators for timetabling with evolutionary algorithms. In: Lotfi, A. (ed.) Proceedings of the 5th International Conference on Recent Advances in Soft Computing, UK, December 16-18, pp. 189–194 (2004)
Malim, M.R., Khader, A.T., Mustafa, A.: Artificial Immune Algorithms for University Timetabling. In: Burke, E.K., Rudova, H. (eds.) The 6th International Conference on Practice and Theory of Automated Timetabling, Brno, Czech Republic, pp. 234–245 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shaker, K., Abdullah, S. (2010). Controlling Multi Algorithms Using Round Robin for University Course Timetabling Problem. In: Zhang, Y., Cuzzocrea, A., Ma, J., Chung, Ki., Arslan, T., Song, X. (eds) Database Theory and Application, Bio-Science and Bio-Technology. BSBT DTA 2010 2010. Communications in Computer and Information Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17622-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-17622-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17621-0
Online ISBN: 978-3-642-17622-7
eBook Packages: Computer ScienceComputer Science (R0)