Automatic timetabling using artificial immune systems

He, Yulan; Hui, Siu Cheung and Lai, Edmund Ming-Kit (2005). Automatic timetabling using artificial immune systems. In: Algorithmic Applications in Management, pp. 55–65.

DOI: https://doi.org/10.1007/11496199_8

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).

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI