Resumen

ABOYTES-OJEDA, Mario; LAUREANO-CRUCES, Ana Lilia  y  RAMIREZ-RODRIGUEZ, Javier. Tabu search algorithm for a variation of the coloring problem. Rev. Mat [online]. 2013, vol.20, n.2, pp.215-230. ISSN 1409-2433.

The generalized robust coloring problem (GRCP) resolves timetabling problems that consider special constraints. As a generalization of the robust coloring problem, which is in turn a generalization of the coloring problem, the GRCP is then a NP-Complete problem, so it is necessary to use approximate methods to find good solutions in a reasonable computation time. This paper presents a tabu search algorithm to schedule cases from 30 to 180 hours per week, for some of them it found the optimal solution, in other cases, the solution obtained exceeds the best known solution. It also presents examples of greater size to the known, obtaining very competitive results, which can be verified by the absence of class conflict.

Palabras clave : robust coloring; timetabling problems; heuristics.

        · resumen en Español     · texto en Español     · Español ( pdf )