A GRASP+VND HEURISTIC FOR THE SCHOOL TIMETABLING PROBLEM

• Autor(a) principal: De Oliveira, Janio Gloria
• Data de Publicação: 2012
• Outros Autores: Vianna, Dalessandro Soares, Vianna, Marcilene de Fátima Dianin
• Tipo de documento: Artigo
• Idioma: por
• Título da fonte: Sistemas & Gestão
• Texto Completo: https://www.revistasg.uff.br/sg/article/view/V7N3A3
• topic: Metaheuristics; GRASP; VND; School timetabling problem; Metaheuristics; GRASP; VND; School timetabling problem; Metaheurística; GRASP; VND; Problema de Horário Escolar

This work proposes an hybrid GRASP metaheuristic using, in the local search phase, the VND technique to solve the timetabling problem. It is considered to review data of Escola Agrotécnica Federal of Alegre-ES-Brazil in the years of 2006 and 2007 and other instances generated at this work for testing, for scheduling two rounds of education high school. The method proposed intends to satisfy the restrictions of timetable of the institution, such as: to meet teachers on the amount of days that their classes are distributed within hours of its availability; to minimize the number of consecutive classes in the same discipline; to prevent the occurrence of teaching vacancies; to minimize the occurrence of “windows” at the timetable of the teacher; to avoid overlapping of classes from the same teacher; to avoid that exists a classroom lecture with the same time with more than one teacher and other restrictions that bring quality to the timetable. The computational results demonstrated the feasibility of its use generates timetable that serve all restrictions of feasibility and a percentage above 85% for restrictions of quality of the solution.