Gravitational Swarm Approach for Graph Coloring

We introduce a new nature inspired algorithm to solve the Graph Coloring Problem (GCP): the Gravitational Swarm. The Swarm is composed of agents that act individually, but that can solve complex computational problems when viewed as a whole. We formulate the agent’s behavior to solve the GCP. Agents move as particles in the gravitational field defined by some target objects corresponding to graph node colors. Knowledge of the graph to be colored is encoded in the agents as friend-or-foe information. We discuss the convergence of the algorithm and test it over well-known benchmarking graphs, achieving good results in a reasonable time.

[1]  Manuel Graña,et al.  Further Results on Swarms Solving Graph Coloring , 2010, ICCSA.

[2]  Alok Singh,et al.  A swarm intelligence approach to the quadratic minimum spanning tree problem , 2010, Inf. Sci..

[3]  Guangzhao Cui,et al.  Modified PSO algorithm for solving planar graph coloring problem , 2008 .

[4]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1998 .

[5]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[6]  Anne Condon,et al.  Experiments with parallel graph coloring heuristics and applications of graph coloring , 1993, Cliques, Coloring, and Satisfiability.

[7]  Jonathan S. Turner,et al.  Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[8]  Dervis Karaboga,et al.  A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..

[9]  Manuel Graña,et al.  APLICACION DE ALGORITMOS ESTOCASTICOS DE OPTIMIZACION AL PROBLEMA DE LA DISPOSICION DE OBJETOS NO-CONVEXOS , 2001 .

[10]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[11]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[12]  Bruce P. Graham,et al.  An Algorithm for Determining the Chromatic Number of a Graph , 1973, SIAM J. Comput..

[13]  Craig W. Reynolds.  Steering Behaviors For Autonomous Characters , 1999 .

[14]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

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

[16]  Phil Husbands,et al.  Artificial Life IX: Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems , 2004 .

[17]  Alain Hertz,et al.  Finding the chromatic number by means of critical graphs , 2000, Electron. Notes Discret. Math..

[18]  W ReynoldsCraig.  Flocks, herds and schools: A distributed behavioral model , 1987 .

[19]  Giandomenico Spezzano,et al.  An adaptive flocking algorithm for performing approximate clustering , 2009, Inf. Sci..

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

[21]  Manuel Graña,et al.  On the ability of Swarms to compute the 3-coloring of graphs , 2008, ALIFE.

[22]  Ronald D. Dutton,et al.  A New Graph Colouring Algorithm , 1981, Comput. J..

[23]  Julia Handl,et al.  Ant-based and swarm-based clustering , 2007, Swarm Intelligence.

[24]  Fangzhen Ge,et al.  Chaotic ant swarm for graph coloring , 2010, 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[25]  T. Stützle,et al.  An application of Iterated Local Search to the Graph Coloring Problem , 2007 .

[26]  David Taniar,et al.  Computational Science and Its Applications - ICCSA 2010, International Conference, Fukuoka, Japan, March 23-26, 2010, Proceedings, Part I , 2010, ICCSA.

[27]  Pingzhi Fan,et al.  MTPSO algorithm for solving planar graph coloring problem , 2011, Expert Syst. Appl..