Comparison of Bioinspired Algorithms Applied to the Timetabling Problem in Sport

Silva J.; Cabrera D.; Maco J.; Villón M.; Guliany J.G.; Roncallo A.; Palma H.H. · Procedia Computer Science (2020) · DOI: 10.1016/j.procs.2020.03.100

Resumen

The problems of timetabling tasks or events, in general, are subject to sets of restrictions such as: creation of work roles, operation of different teams, operation personnel, among others. These types of problems are classified as NP class [1]. In this study, special attention is paid to the scheduling problem applied to sports clubs, for which different bioinspired algorithms are implemented and compared.

Instituciones: Universidad Peruana de Ciencias Aplicadas