A Network Flow Based Construction for a GRASP plus SA Algorithm to Solve the University Timetabling Problem

Educational timetabling is one of the most researched topics in the field of timetabling. This problem consists of allocating a set of lectures to available rooms and periods, considering students and teachers requests and constraints. Several mathematical models for this problem can be found in the literature. The model considered in this paper is based on courses curricula of a university, proposed in the second International Timetabling Competition (ITC-2007). A maximum flow partial solution is used together with the GRASP constructive algorithm to generate a local solution improved by Simulated Annealing. Computational experiments were performed in ITC-2007 instances, and the results were compared to the best solutions of ITC-2007 and to the literature.