Solving Graph Coloring Problems Using Cultural Algorithms

In this paper, we combine a novel Sequential Graph Coloring Heuristic Algorithm (SGCHA) with a non-systematic method based on a cultural algorithm to solve the graph coloring problem (GCP). The GCP involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In our solving approach, we first use an estimator which is implemented with SGCHA to predict the minimum colors. Then, in the non-systematic part which has been designed using cultural algorithms, we improve the prediction. Various components of the cultural algorithm have been implemented to solve the GCP with a self adaptive behavior in an efficient manner. As a result of utilizing the SGCHA and a cultural algorithm, the proposed method is capable of finding the solution in a very efficient running time. The experimental results show that the proposed algorithm has a high performance in time and quality of the solution returned for solving graph coloring instances taken from DIMACS website. The quality of the solution is measured here by comparing the returned solution with the optimal one.

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

[2]  R. Reynolds.  AN INTRODUCTION TO CULTURAL ALGORITHMS , 2008 .

[3]  A. Gamst,et al.  Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.

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

[5]  Carlos A. Coello Coello,et al.  Solving timetabling problems using a cultural algorithm , 2011, Appl. Soft Comput..

[6]  John Cocke,et al.  A methodology for the real world , 1981 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Robert G. Reynolds,et al.  A Testbed for Solving Optimization Problems Using Cultural Algorithms , 1996, Evolutionary Programming.

[9]  Zaher Mahjoub,et al.  On a parallel genetic-tabu search based algorithm for solving the graph colouring problem , 2009, Eur. J. Oper. Res..

[10]  Daniel Br.  New Methods to Color the Vertices of a Graph , 1979 .

[11]  Marcel Bergerman,et al.  Cultural algorithms: concepts and experiments , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[12]  M. Ghiselin,et al.  Coevolution: Genes, Culture, and Human Diversity , 1991, Politics and the Life Sciences.

[13]  Carlos A. Coello Coello,et al.  Evolutionary multiobjective optimization using a cultural algorithm , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[14]  John Cocke,et al.  Register Allocation Via Coloring , 1981, Comput. Lang..