A New and Fast 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.

Download Full-text

Solving Dynamic Graph Coloring Problem Using Dynamic Pool Based Evolutionary Algorithm

Applications of Evolutionary Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-55792-2_13 ◽

2017 ◽

pp. 189-204

Author(s):

Gizem Sungu ◽

Betul Boz

Keyword(s):

Evolutionary Algorithm ◽

Graph Coloring ◽

Dynamic Graph ◽

Coloring Problem ◽

Graph Coloring Problem

Download Full-text

An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem

International Journal of Applied Evolutionary Computation ◽

10.4018/ijaec.2014040102 ◽

2014 ◽

Vol 5 (2) ◽

pp. 22-36 ◽

Cited By ~ 2

Author(s):

Meriem Bensouyad ◽

Nousseiba Guidoum ◽

Djamel-Eddine Saïdouni

Keyword(s):

Evolutionary Algorithm ◽

Graph Coloring ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

New Approach ◽

Coloring Problem ◽

Graph Coloring Problem ◽

First Time ◽

General Graphs ◽

Better Than

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.

Download Full-text