A Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms

Course Timetabling is a well known NP hard problem. This paper presents a hybrid Simulated Annealing-Tabu Search algorithm named Fralonso, which was developed for the Course timetabling problem of Patat track2. This algorithm is designed to find feasible solutions. Fralonso has two phases; the first one finds a feasible solution which is improved in the second one. In every phase Tabu Search is used after Simulated Annealing algorithm in order to refine the search process. In addition, Fralonso uses two neighborhood schemes to preserve a good diversity level.