A New and Fast Evolutionary Algorithm for Strict Strong Graph Coloring Problem

Abstract This paper tackles the strict strong graph coloring (SSColoring). This graph coloring task aims at finding the minimum number of colors where each vertex dominates at least one non-empty color class. This problem has been solved for trees and proved to be NP-complete for general graphs. The present work introduces a new evolutionary algorithm for solving the SSColoring problem for general graphs. Contrary to the evolutionary algorithm proposed in [1] , the proposed variant searches an optimal SSColoring using legal coloring space, a particular crossover and a polynomial optimization operator. Through experiments, we show that the proposed approach gives better results than previous approaches.

[1]  Djamel-Eddine Saïdouni,et al.  The Strict Strong Coloring Based Graph Distribution Algorithm , 2013, Int. J. Appl. Metaheuristic Comput..

[2]  Walter Klotz.  Graph Coloring Algorithms , 2002 .

[3]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[4]  Michael O. Albertson,et al.  Partial list colorings , 2000, Discret. Math..

[5]  Alexandr V. Kostochka,et al.  Total Colourings of Planar Graphs with Large Girth , 1998, Eur. J. Comb..

[6]  C. Prins,et al.  An Evolutionary Algorithm with Path Relinking for a Bi-objective Multiple Traveling Salesman Problem with Profits , 2014 .

[7]  Igor E. Zverovich.  A new kind of graph coloring , 2006, J. Algorithms.

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

[9]  Richard H. Schelp,et al.  Vertex colorings with a distance restriction , 1998, Discret. Math..

[10]  Zbigniew Michalewicz,et al.  Evolutionary algorithms , 1997, Emerging Evolutionary Algorithms for Antennas and Wireless Communications.

[11]  Lutz Volkmann,et al.  Relations between the lower domination parameters and the chromatic number of a graph , 2004, Discret. Math..

[12]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[13]  Mohammed Haddad,et al.  Coloring based approach for matching unrooted and/or unordered trees , 2013, Pattern Recognit. Lett..

[14]  Mohammed Haddad,et al.  A strict strong coloring of trees , 2009, Inf. Process. Lett..

[15]  Mohammed Haddad,et al.  A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks , 2008, NOTERE.

[16]  Christian Blum,et al.  Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm , 2013, ICCS.

[17]  Djamel-Eddine Saïdouni,et al.  A Generalized Graph Strict Strong Coloring Algorithm , 2012, Int. J. Appl. Metaheuristic Comput..

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

[19]  Djamel-Eddine Saïdouni,et al.  An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem , 2014, Int. J. Appl. Evol. Comput..

[20]  Nair Maria Maia de Abreu,et al.  A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..