A new Simulated Annealing algorithm for the robust coloring problem

The robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. thisproblem has been proved as np-hard and in instances larger than 30 vertices, meta-heuristics are required. in this paper a simulated annealing algorithm is proposed, and his performance is compared against other techniques such as grasp, tabu search and scatter search. in the classic instances of the problem our proposalmethod which gives the best solutions at this moment.