Abstract—Timetabling is the task of creating a schedule while satisfying some constraints. This problem is an NPComplete problem, so solving it needs some heuristics. There are many types of timetabling; we mainly focused on university course timetabling. There have been many efforts in literature, but most of them have used some limiting assumptions that cause their approach to be unusable in real situations. We've used an evolutionary approach based on genetic algorithm to solve this problem in real situation and in a reasonable amount of time. We've used real data from our department in the university and our approach could solve the problem in about 15 minutes, while manually timetabling may take three days.
Index Terms—Timetabling, university timetabling, genetic algorithm.
Mortaza Doulaty is with the Department of Computer Science, University of Sheffield, Sheffield, UK (e-mail: email@example.com). Mohammad-Reza Feizi-Derakhshi is with the Department of Computer Science, University of Tabriz, Tabriz, Iran (e-mail: firstname.lastname@example.org). Mehrdad Abdi is with the Amirkabir University of Tehran, Tehran, Iran (e-mail: email@example.com).
Cite:M. Doulaty, M. R. Feizi Derakhshi, and M. Abdi, "Timetabling: A State-of-the-Art Evolutionary Approach," International Journal of Machine Learning and Computing vol.3, no. 3, pp. 255-258, 2013.