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.

[1]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[2]  Vahid Lotfi,et al.  A graph coloring algorithm for large scale scheduling problems , 1986, Comput. Oper. Res..

[3]  D. Werra,et al.  Some experiments with simulated annealing for coloring graphs , 1987 .

[4]  Celia A. Glass,et al.  Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm , 2003, J. Comb. Optim..

[5]  J. Culberson.  Iterated Greedy Graph Coloring and the Difficulty Landscape , 1992 .

[6]  Alain Hertz,et al.  A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..

[7]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[8]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[9]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[10]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[11]  Alain Hertz,et al.  Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs , 1995, J. Heuristics.

[12]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[13]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[14]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[15]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[16]  Kathryn A. Dowsland,et al.  Ant colony optimization for the examination scheduling problem , 2005, J. Oper. Res. Soc..

[17]  Celia A. Glass,et al.  A polynomially searchable exponential neighbourhood for graph colouring , 2005, J. Oper. Res. Soc..

[18]  Rafael Martí,et al.  A GRASP for Coloring Sparse Graphs , 2001, Comput. Optim. Appl..

[19]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[20]  Thomas Stützle,et al.  An Experimental Investigation of Iterated Local Search for Coloring Graphs , 2002, EvoWorkshops.