An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem

A very promising approach for combinatorial optimization is evolutionary algorithms. As an application, this paper deals with the strict strong graph coloring problem defined by Haddad and Kheddouci (2009) where the authors have proposed an exact polynomial time algorithm for trees. The aim of this paper is to introduce a new evolutionary algorithm for solving this problem for general graphs. It combines an original crossover and a powerful correction operator. Experiments of this new approach are carried out on large Dimacs Challenge benchmark graphs. Results show very competitive with and even better than those of state of the art algorithms. To the best of the author's knowledge, it is the first time that an evolutionary algorithm is proposed to solve the strict strong graph coloring problem.

[1]  Vincenzo De Florio,et al.  Innovations and Approaches for Resilient and Adaptive Systems , 2012 .

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

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

[4]  Beyond Learning: E-Learning Models for Scientific Research , 2015 .

[5]  Jens Gottlieb,et al.  Permutation-based evolutionary algorithms for multidimensional knapsack problems , 2000, SAC '00.

[6]  Leng Ho Keat.  Analysing Blogs in Market Research , 2015 .

[7]  Vincenzo De Florio,et al.  Technological Innovations in Adaptive and Dependable Systems: Advancing Models and Concepts , 2012 .

[8]  Sabiha F. Jawad,et al.  Fuzzy Logic-Based Security Evaluation of Stream Cipher , 2014 .

[9]  Nicoletta Sala,et al.  Reflexing Interfaces: The Complex Coevolution of Information Technology Ecosystems , 2008 .

[10]  David Chalupa.  Population-based and learning-based metaheuristic algorithms for the graph coloring problem , 2011, GECCO '11.

[11]  Geoff Lancaster,et al.  Examining the Dynamics of Value Propositions in Digital Books: A Social Constructivist Perspective , 2015 .

[12]  Taghreed Justinia.  Software-Assisted Transcribing for Qualitative Interviews: Practical Guidelines , 2015 .

[13]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[14]  Hamed Fazlollahtabar,et al.  Integration between Mathematical Programming and Fuzzy Logic to Optimize Consumers Behavior , 2014, Int. J. Inf. Syst. Serv. Sect..

[15]  Ludovic Henrio,et al.  Mixing Workflows and Components to Support Evolving Services , 2010, Int. J. Adapt. Resilient Auton. Syst..

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

[17]  Chellapilla Patvardhan,et al.  Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm , 2014, Int. J. Appl. Evol. Comput..

[18]  Peter Fox,et al.  Collaborative Knowledge in Scientific Research Networks , 2014 .

[19]  Brian Matthews,et al.  Towards the Interoperable Data Environment for Facilities Science , 2015 .

[20]  Marcello Cinque,et al.  Adaptive Modeling of Routing Algorithms for Wireless Sensor Networks , 2010, Int. J. Adapt. Resilient Auton. Syst..

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

[22]  Krassimir T. Atanassov,et al.  Genetic Algorithms Quality Assessment Implementing Intuitionistic Fuzzy Logic , 2014 .

[23]  K. Bhattacharya.  A Second Life in Qualitative Research: Creating Transformative Experiences , 2014 .

[24]  Alain Hertz,et al.  Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs , 1995, J. Heuristics.

[25]  A. Ghorbani,et al.  Market Research Methodologies: Multi-Method and Qualitative Approaches , 2014 .

[26]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[27]  Piero Consoli,et al.  Swarm Intelligence heuristics for Graph Coloring Problem , 2013, 2013 IEEE Congress on Evolutionary Computation.

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

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

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

[31]  Michael S. Bruno,et al.  The Center for Secure and Resilient Maritime Commerce: A DHS National Center of Excellence in Maritime Security , 2014 .

[32]  Janet J. Fredericks.  Persistence of Knowledge across Layered Architectures , 2015 .

[33]  Victor C. X. Wang.  Handbook of Research on Scholarly Publishing and Research Methods , 2014 .

[34]  Pawel B. Myszkowski,et al.  Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem , 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications.

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

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

[37]  M. Dorigo,et al.  Algodesk : an experimental comparison of eight evolutionary heuristics applied to the Quadratic Assignment Problem , 1995 .

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

[39]  Leo Marcus.  Abstract Fault Tolerance: A Model-Theoretic Approach to Fault Tolerance and Fault Compensation without Error Correction , 2011, Int. J. Adapt. Resilient Auton. Syst..

[40]  Konstantin Solomin,et al.  Constructing Historical Knowledge through Graphic Boundary Objects , 2015 .

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