The Complexity of Timetable Construction Problems
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant algorithms for the university course timetabling problem with regard to the state-of-the-art
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
University course timetabling using ACO: a case study on laboratory exercises
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
| Hi-index | 0.00 |
This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of laboratory exercises in a highly constrained environment, for which a formal definition is given. Solution representation technique appropriate to the problem is defined, along with associated genetic operators and a local search algorithm. The approach presented in the paper has been successfully used for timetabling at the authors' institution and it was capable of generating timetables for complex problem instances.