Article thumbnail

Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta

By Pedro Lara Velázquez, Miguel Ángel Gutiérrez Andrade, Javier Ramírez Rodríguez and Rafael López Bracho


Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join vertices whose endpoint are equally colored. Based on this previous definition, the Robust Coloring Problem is set when searching the valid k-coloring of minimum rigidity. Yáñez and Ramírez proved that this is an NP-hard problem. In this work we present an evolutive algorithm based in the scatter search technique, which obtains optimal solutions for those instances for which an optimal solution is known, and obtains the best known solutions compared to other heuristics, such as: simulated annealing, tabu search and partial enumeration

Topics: Mathematics, QA1-939
Publisher: Universidad de Costa Rica
Year: 2012
DOI identifier: 10.15517/rmta.v12i1-2.255
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles