An improved ant colony optimisation heuristic for graph colouring

摘要

The focus of this paper is an ant colony optimisation heuristic for the graph colouring problem. We start by showing how a series of improvements enhance the performance of an existing ant colony approach to the problem and then go on to demonstrate that a further strengthening of the construction phase, combined with a tabu search improvement phase, raise the performance to the point where it is able to compete with some of the best-known approaches on a series of benchmark problems. (c) 2007 Elsevier B.V. All rights reserved.