Abstract
University timetabling problem is a very common and seemingly simple, but yet very difficult problem to solve in practice. While solution definitely exists (evidenced by the fact that we do hold classes), an automated optimal schedule is very difficult to derive at present. There were successful attempts to address this problem using heuristics search methods. However, until now, university timetabling is still largely done by hand, because a typical university setting requires numerous customized complicated constraints that are difficult to model or automate. In addition, there is a problem of certain constraints being inviolable, while others are merely desirable. This paper intends to address the university timetabling problem that is highly constrained using Artificial Immune System. Empirical study on course timetabling for the School of Computer Engineering (SCE), Nanyang Technological University (NTU), Singapore as well as the benchmark dataset provided by the Metaheuristic Network shows that our proposed approach gives better results than those obtained using the Genetic Algorithm (GA).
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
Yu, E., Sung, K.S.: A genetic algorithm for a university weekly courses timetabling problem. International Transactions in Operational Research 9(6), 703–717 (2002)
Burke, E.K., Elliman, D.G., Weare, R.F.: A university timetabling system based on graph colouring and constraint manipulation. Journal of Research on Computing in Education 27(1), 1–18 (1994)
Balakrishnan, N., Lucena, A., Wong, R.T.: Scheduling examinations to reduce second-order conflicts. Computers and Operational Research 19(5), 353–361 (1992)
Burke, E.K., Eckersley, A., McCollum, B., Petrovic, S., Qu, R.: Using simulated annealing to study behaviour of various exam timetabling data sets. In: Proceedings of the Fifth Metaheuristics International Conference (MIC 2003), Kyoto, Japan (August 2003)
Jaumard, B., Cordeau, J.-F., Morales, R.: Efficient Timetabling Solution with Tabu Search. Avaliable from Metaheuristics Network - Intenational Timetabling Competition (2003), http://www.idsia.ch/Files/ttcomp2002/jaumard.pdf
Chiarandini, M., Socha, K., Birattari, M., Rossi-Doria, O.: An effective hybrid approach for the university course timetabling problem. Journal of Scheduling (2003) (to appear)
Laporte, G., Gendreau, M., Potvin, J.-Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285–300 (2000)
Metaheuristics Network, http://www.metaheuristics.org/
Dasgupta, D., Ji, Z., González, F.: Artificial immune system (ais) research in the last five years. In: Proceedings of the International Conference on Evolutionary Computation Conference (CEC), Canbara, Australia (December 2003)
de Castro, L.N., Von Zuben, F.J.: Learning and optimization using the clonal selection principle. IEEE Transactions on Evolutionary Computation, Special Issue on Artificial Immune Systems 6(3), 239–251 (2002)
de Castro, L.N., Timmis, J.I.: Artificial immune system as a novel soft computing paradigm. Soft Computing 7(8), 526–544 (2003)
University Course Timetabling Benchmark Solution Score Calculation, http://www.idsia.ch/Files/ttcomp2002/IC_Problem/node2.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, Y., Hui, S.C., Lai, E.MK. (2005). Automatic Timetabling Using Artificial Immune System. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_8
Download citation
DOI: https://doi.org/10.1007/11496199_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)