A SA-VNS approach for the High School Timetabling Problem Samuel S. Brito 1 George H. G. Fonseca 2 Tulio A. M. Toﬀolo 3 Haroldo G. Santos 4 Marcone J. F. Souza 5 Computing Department Federal University of Ouro Preto Ouro Preto, Brazil Abstract The High School Timetabling Problem consists in assigning timeslots and re- sources to events, satisfying constraints which heavily depend on the speciﬁc institu- tion. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simulated An- nealing and Variable Neighborhood Search metaheuristics. One important struc- tural feature of our approach is the use of the Kingston’s High School Timetabling Engine (KHE) to generate initial solutions combined with the multi-neighborhood search. Such approach led us to the ﬁnals of the ongoing competition. Keywords: Variable Neighbourhood Search, Simulated Annealing, High School Timetabling Problem, Third International Timetabling Competition 1 Email: samuelsouza@iceb.ufop.br 2 Email: george@decea.ufop.br 3 Email: tulio@toffolo.com.br 4 Email: haroldo@iceb.ufop.br 5 Email: marcone.freitas@gmail.com