Simulated Annealing-Based Algorithm for a Real-World High School Timetabling Problem

Abstract

Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's results published before and the handmade timetables created by experts.