Alocação otimizada de horários acadêmicos com disponibilidade restrita de professores usando algoritmos genéticos

Abstract

The generation of academic timetables is one of the most complex and arduous activities faced by educational institutions at the beginning of each academic period. In most cases, the solution found for this problem, commonly called “timetabling” in the literature, is performed manually, which makes the process very tiring and time-consuming for institutions. This problem is considered a great challenge in combinatorial optimization, due to the wide set of variables and constraints involved, being considered an NP-Complete problem, where there is no possibility of solution through conventional programming methods. This article deals with the use of genetic algorithm techniques to find an optimal solution to the problem of scheduling academic schedules that takes into account the restrictions of the student and the faculty, in order to favor the academic performance of students and adapt to availability from the students . teachers. For this work, it is expected to develop a genetic algorithm that is able to obtain valid results that meet the constraints of the problem in a reasonably considerable time. Technically, it is expected that the algorithm, from a set of input data, processes and returns a solution that has the highest fitness value - the lowest number of infractions committed - between generations of individuals (solutions). This article uses data from the Information Systems course grid at the Federal University of Rio Grande Norte as a base. After modifications in the base and the experiments were carried out, the genetic algorithm proved to be efficient and managed to achieve the objectives, generating adequate academic schedules and compatible with the established restrictions.