A MAX-MIN Ant System for the University Course Timetabling Problem

By Krzysztof Socha, Joshua D. Knowles, Michael Sampels. International Workshop on Ant Colony Optimization and Swarm Intelligence, 2002

302 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A survey of metaheuristic-based techniques for University Timetabling problems (2007, background): “In Socha and Samples (2003) and Socha et al. (2002) , the authors present two ant-based algorithms—an Ant Colony System and a MAX-MIN system—and provide a comparison between them.”
A graph-based hyper-heuristic for educational timetabling problems (2007, background): “For example, in exam timetabling, exams taken by common students often need to be spread out over the timeslots so that students do not have to sit in two exams that are too close to each other.”
Artificial Intelligence techniques: An introduction to their use for modelling environmental systems (2008, methodology): “The technique has also been applied in management for time scheduling [146] and resource allocation [171].”
A Tabu-Search Hyperheuristic for Timetabling and Rostering (2003, methodology): “On seven out of eleven benchmark problems, the tabusearch hyperheuristic, which was not designed with this problem in mind, produced solutions which were better than or equal to those produced using a sophisticated local search method and an ant algorithm, both of which were tailor-made algorithms f”