A genetic algorithm in a schedule problem with special constraints
Sparad:
| Författarna: | , |
|---|---|
| Materialtyp: | artículo original |
| Status: | Versión publicada |
| Utgivningstid: | 2011 |
| Beskrivning: | Ramírez (2001) introduced the generalized robust coloring problem (GRCP), this problem lets solve timetabling problems which considers constraints such as: two events can not be assigned at the same time and there must be at least d days between two events.The GRCP deals with a robust coloring for a given graph with a fixed number of colors, not necessarily the chromatic number and considers the distance between colors as the penalization of complementary edges. It was shown that the problem is NP-complete, so it is necessary to use approximate methods to find good solutions in a reasonable time. This paper presents a hybrid of a genetic algorithm with a local search for cases of 30-120 hours per week; it is shown that for some cases the found solution is optimal and in other cases the solutions are very promising. |
| Land: | Portal de Revistas UCR |
| Organisation: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Språk: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/2095 |
| Länkar: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2095 |
| Access Level: | acceso abierto |
| Nyckelord: | timetabling special constrains heuristics horarios restricciones especiales heuristícas |