Diseño e implementación de un algoritmo GRASP para el problema de coloración de grafos

Abstract

One of the difficulties in finding the best solution for combinatorial optimization problems is the high computational cost to obtain them.  Therefore it is necessary to use algorithms based on metaheuristics for feasible solutions to a reasonable computational cost.  In this context,  this  paper  addresses  the  design  of  a  heuristic  based  on  the  GRASP  methodology  for  graph  coloring  problem.  This  algorithm  is  implemented in Mathematica has 8.0.4.0 ® of the problem to measure quality.