Ant algorithms for the university course timetabling problem with regard to the state-of-the-art

Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented - Ant Colony System and MAX-MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a reference random restart local search algorithm. Further, both ant algorithms are compared on an additional set of instances. Conclusions are drawn about the performance of ant algorithms on timetabling problems in comparison to other metaheuristics. Also the design, implementation, and parameters of ant algorithms solving the university course timetabling problem are discussed. It is shown that the particular implementation of an ant algorithm has significant influence on the observed algorithm performance. © Springer-Verlag Berlin Heidelberg 2003.SCOPUS: ar.k