A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
Summary: 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.
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- An application of a new hybrid genetic algorithm to graph coloring
- Graph k-colorability using a threshold accepting and Davis-Putnam hybrid algorithm
- scientific article; zbMATH DE number 597813 (Why is no real title available?)
- scientific article; zbMATH DE number 2013463 (Why is no real title available?)
This page was built for publication: A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659448)
