A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
A hybrid algorithm which combines mathematical programmin g tech- niques (Kruskal’s algorithm and the strategy of maintainin g arc consis- tency to solve constraint satisfaction problem “CSP”) and h euristic meth- ods (musical composition method and DSATUR) to resolve the r obust graph coloring prob...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2016 |
| País: | México |
| Recursos: | Universidad Autónoma Metropolitana |
| Repositorio: | Redalyc-UAM |
| OAI Identifier: | oai:redalyc.org:45349329006 |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=45349329006 |
| Access Level: | acceso abierto |
| Palavra-chave: | Física, Astronomía y Matemáticas Metaheuristics integer programming combinatorial optimization |
| Resumo: | A hybrid algorithm which combines mathematical programmin g tech- niques (Kruskal’s algorithm and the strategy of maintainin g arc consis- tency to solve constraint satisfaction problem “CSP”) and h euristic meth- ods (musical composition method and DSATUR) to resolve the r obust graph coloring problem (RGCP) is proposed in this paper. Exp erimental result shows that this algorithm is better than the other alg orithms pre- sented on the literature. |
|---|