Loading...

A hybrid algorithm of simulated annealing and tabu search for graph colouring problem

Pahlavani, A ; Sharif University of Technology | 2011

316 Viewed
  1. Type of Document: Article
  2. DOI: 10.1504/IJOR.2011.040694
  3. Publisher: 2011
  4. Abstract:
  5. 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
  6. Keywords:
  7. Graph colouring ; Hybrid meta-heuristic ; SA ; Simulated annealing ; Tabu search ; TS
  8. Source: International Journal of Operational Research ; Volume 11, Issue 2 , 2011 , Pages 136-159 ; 17457645 (ISSN)
  9. URL: http://www.inderscience.com/offer.php?id=40694