Ants and Graph Coloring

Ants algorithm is an evolutionary search method for solving combinatorial optimization problems. In this note we propose a version of the algorithm for coloring a graph with a fixed number of colors.

[1]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[2]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[3]  John Shawe-Taylor,et al.  Bitstream neurons for graph colouring , 1995 .

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

[5]  John Shawe-Taylor,et al.  Analysis of the mean field annealing algorithm for graph colouring , 1995 .

[6]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

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

[8]  Janez Zerovnik.  A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph , 1989, Inf. Process. Lett..

[9]  M. Trick,et al.  Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .

[10]  John Shawe-Taylor,et al.  Graph Colouring by Maximal Evidence Edge Adding , 2000, PATAT.

[11]  Craig A. Morgenstern.  Distributed coloration neighborhood search , 1993, Cliques, Coloring, and Satisfiability.

[12]  Janez Zerovnik.  A randomized algorithm for k-colorability , 1994, Discret. Math..

[13]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

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

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

[16]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[17]  Afonso Ferreira,et al.  BOUNDING THE PROBABILITY OF SUCCESS OF STOCHASTIC METHODS FOR GLOBAL OPTIMIZATION , 1993 .

[18]  John Shawe-Taylor,et al.  Adapting temperature for some randomized local search algorithms , 1998 .

[19]  D. J. A. Welsh,et al.  A randomised 3-colouring algorithm , 1989, Discret. Math..

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

[21]  Janez Žerovnik,et al.  How Well Can Ants Color Graphs , 2000 .

[22]  John Shawe-Taylor,et al.  Adapting the energy landscape for MFA , 1995 .

[23]  Keith Edwards,et al.  The Complexity of Colouring Problems on Dense Graphs , 1986, Theor. Comput. Sci..