A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A survey of automated timetabling
A survey of automated timetabling
An effective hybrid algorithm for university course timetabling
Journal of Scheduling
The university course timetabling problem with a three-phase approach
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
| Hi-index | 0.00 |
The Course Timetabling Problem consists in the weekly scheduling for all the lectures (events) of a set of university courses, subject to certain constraints. Unfortunately, course timetabling problems vary from university to university, and as far as we know, no standard formulation has been proposed from the community. Nevertheless, the International Timetabling Competitions, ITC-2002 and ITC-2007, have been organized with the aim of creating the common formulation for comparison. The formulation has become quite standard, and many solutions have been proposed in the literature. Most of the provided solutions utilize non-deterministic techniques. In this paper, we introduce a new deterministic algorithm for the solution of timetabling problems. The instances upon which the algorithm was tested are the official ones of the ITC-2002 web page. Almost all solutions run in less than 10% of the ITC-2002 benchmark time. The analysis is still ongoing, and it includes suitable extensions for tackling problems of the ITC-2007.