Loading...

A hybrid SA/TS algorithm for graph coloring problem [electronic resource]

Pahlavani, A. (Ali) ; Sharif University of Technology

506 Viewed
  1. Type of Document: Article
  2. DOI: 10.1504/IJOR.2011.040694
  3. Abstract:
  4. The graph colouring problem, as an important NP-complete problem, is considered in this paper and a hybrid meta-heuristic approach is developed to solve it. The initial solution of the algorithm, generated by a heuristic method, is used by a simulated annealing (SA) approach to generate new solutions until no progress in a number of solutions reported. At this stage, the algorithm will use a tabu search routine and this local search operator will be followed for some iterations. After finding a better solution, the algorithm is again followed through SA. Efficiency of the algorithm is showed through various experiments on well-known benchmark problems of DIMACS. Comparison with the available algorithms shows considerable performance in terms of solution quality and computational time
  5. Keywords:
  6. Graph colouring ; Hybrid metaheuristics ; Tabu search ; Simulated annealing
  7. Source: International Journal of Operational Research (IJOR) ; Volume 11, Number 2/2011 Pages 136-159
  8. URL: http://inderscience.metapress.com/content/5518453ugk0h022m