In this paper, an iterated local search algorithm is proposed to find the feasible solution for the University Course Timetabling Problem. Three key phases are involved in the proposed algorithm framework: initialization, intensification and diversification. Once a partial-feasible initial timetable is constructed, a simulated annealing based local search and a diversification procedure that brings moderate perturbation or even improvement to the current solution are performed in an iterative manner until a stop condition is met. The proposed a...
