Resumo

ARIAS-OSORIO, Javier  e  MORA-ESQUIVEL, Andrés. A solution to the university course timetabling problem using a hybrid method based on genetic algorithms. Dyna rev.fac.nac.minas [online]. 2020, vol.87, n.215, pp.47-56.  Epub 05-Jan-2021. ISSN 0012-7353.  https://doi.org/10.15446/dyna.v87n215.85933.

In this study, we address the current issues that usually manifest during the programming of university courses, classified as University Course Timetabling Problem, which is considered as a NP-hard problem due to the high computational demand that it requires.

To solve the problem, a Mixed Integer Linear Programming model is proposed, which serves as a reference when dimensioning the problem and the restrictions that must be considered. Next, a hybrid metaheuristic method is designed based on the HGATS algorithm, Hybrid Genetic Algorithm Tabu Search Approach, developed by [16], which combines the diversification capacity of the Genetic Algorithm with the strategy of intensification of the Tabu Search Algorithm. Finally, the validation of the proposed algorithm is performed using the data from the programming of the classes from the academic periods 2018-1 and 2018-2 for the academic program of Industrial Engineering at the Industrial University of Santander, obtaining interesting solutions in a reasonable computational time, being that the process of organizing the schedule by the coordinator can last from hours to days, depending on your ability.

Palavras-chave : programming of university courses; metaheuristics; mixed Integer linear programming; HGATS.

        · resumo em Espanhol     · texto em Inglês     · Inglês ( pdf )