Skip to main content
Article thumbnail
Location of Repository

Solving the graph coloring problem via hybrid genetic algorithms

By Sidi Mohamed Douiri and Souad Elbernoussi


Let G = (V,E) an undirected graph, V corresponds to the set of vertices and E corresponds to the set of edges, we focus on the graph coloring problem (GCP), which consist to associate a color to each vertex so that two vertices connected do not possess the same color. In this paper we propose a new hybrid genetic algorithm based on a local search heuristic called DBG to give approximate values of χ(G) for GCP. The proposed algorithm is evaluated on the DIMACS benchmarks and numerical results show that the proposed approach achieves highly competitive results, compared with best existing algorithms

Topics: Graph coloring problem, Genetic algorithm, DBG heuristic, Engineering (General). Civil engineering (General), TA1-2040
Publisher: Elsevier
Year: 2015
DOI identifier: 10.1016/j.jksues.2013.04.001
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.