A Simulated Annealing Hyper-heuristic for University Course Timetabling Problem Extended Abstract

Abstract

The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity an