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

Ali Pahlavani and Kourosh Eshghi

International Journal of Operational Research, 2011, vol. 11, issue 2, 136-159

Abstract: 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.

Keywords: graph colouring; hybrid metaheuristics; tabu search; simulated annealing. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=40694 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:11:y:2011:i:2:p:136-159

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().