Abstract
A hybrid algorithm which includes Simulated Annealing, Local Search and Great Deluge is presented and performed for solving the university course timetabling problems. We propose two enhancements in our algorithm, where one of three soft constraints is satisfied when obtaining a feasible timetabling solution and a few parameters for escaping local minima are introduced in the Great Deluge algorithm which is used for reducing the violations of the soft constraints. The comparison of our results with others using the benchmark instances of the university course timetabling gives that almost all our results are better than those currently published.
