Graph coloring using Intelligent Water Drops algorithm

Graph coloring is a NP-Hard problem and there is not any polynomial algorithm for solving it yet. Different algorithmic approaches have been applied to find the near optimal solution where two issues always were extremely important; proximity of the solution to the optimal one as well as algorithm speed. Swarm based algorithm is one of the approaches that has been considered. Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) are some examples. In this paper, we applied another swarm based algorithm to tackle the graph coloring problem (GCP). Intelligent Water Drops (IWD) algorithm, which is used here, has some pre-requirements to be able to solve a problem. According to these pre-requirements, we customized GCP for IWD. The most important issue raised here is that IWD compounds both heuristic desirability and past experience in one concept which is called the soil, whereas in the case of algorithms like ACO, these concepts are separate (pheromone corresponds to past experience and heuristic desirability has its own separate amount). We utilized a simple interpreter to overcome this restriction of IWD. The proposed algorithm which is called IWDCOL has been evaluated against the random graphs and numerical results show that the IWD algorithm can be one of candidates to tackle the GCP by satisfactory solutions.

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

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

[3]  Tuan Hoang Anh,et al.  A Novel Particle Swarm Optimization-Based Algorithm for the Graph Coloring Problem , 2009, 2009 International Conference on Information Engineering and Computer Science.

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

[5]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

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

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

[8]  Dániel Marx,et al.  RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .

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

[10]  Jin-Kao Hao,et al.  An effective heuristic algorithm for sum coloring of graphs , 2012, Comput. Oper. Res..

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

[12]  Kathryn A. Dowsland,et al.  An improved ant colony optimisation heuristic for graph colouring , 2008, Discret. Appl. Math..

[13]  Sivasankaran Rajamanickam,et al.  Parallel Graph Coloring. , 2015 .

[14]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[15]  M. Dorrigiv,et al.  Algorithms for the graph coloring problem based on swarm intelligence , 2012, The 16th CSI International Symposium on Artificial Intelligence and Signal Processing (AISP 2012).

[16]  Paolo Toth,et al.  A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..

[17]  Hamed Shah-Hosseini,et al.  The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm , 2009, Int. J. Bio Inspired Comput..

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

[19]  Edmund K. Burke,et al.  A University Timetabling System Based on Graph Colouring and Constraint Manipulation , 1994 .

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

[21]  Chae Y. Lee,et al.  APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM , 1996 .

[22]  G. Grimmett,et al.  On colouring random graphs , 1975 .

[23]  Andrew Lim,et al.  Robust Graph Coloring for Uncertain Supply Chain Management , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[24]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[25]  Yixin Yin,et al.  Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem , 2011, J. Comput..

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

[27]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[28]  Hamed Shah-Hosseini,et al.  Problem solving by intelligent water drops , 2007, 2007 IEEE Congress on Evolutionary Computation.

[29]  Geetam Singh Tomar,et al.  A Novel ABC Optimization Algorithm for Graph Coloring Problem , 2013, 2013 5th International Conference on Computational Intelligence and Communication Networks.