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

2015 ◽  
Vol 73 ◽  
pp. 138-145 ◽  
Author(s):  
Meriem Bensouyad ◽  
Nousseiba Guidoum ◽  
Djamel-Eddine Saïdouni
Keyword(s):  
Evolutionary Algorithm ◽  
Graph Coloring ◽  
Coloring Problem ◽  
Graph Coloring Problem

scholarly journals Reduction and Local Search for Weighted Graph Coloring Problem

2020 ◽  
Vol 34 (03) ◽  
pp. 2433-2441 ◽  
Author(s):  
Yiyuan Wang ◽  
Shaowei Cai ◽  
Shiwei Pan ◽  
Ximing Li ◽  
Monghao Yin
Keyword(s):  
Local Search ◽  
Graph Coloring ◽  
Search Algorithm ◽  
Weighted Graph ◽  
Coloring Problem ◽  
Massive Graphs ◽  
Configuration Checking ◽  
New Variant ◽  
Graph Coloring Problem ◽  
Important Extension

The weighted graph coloring problem (WGCP) is an important extension of the graph coloring problem (GCP) with wide applications. Compared to GCP, where numerous methods have been developed and even massive graphs with millions of vertices can be solved well, fewer works have been done for WGCP, and no solution is available for solving WGCP for massive graphs. This paper explores techniques for solving WGCP, including a lower bound and a reduction rule based on clique sampling, and a local search algorithm based on two selection rules and a new variant of configuration checking. This results in our algorithm RedLS (Reduction plus Local Search). Experiments are conducted to compare RedLS with the state-of-the-art algorithms on massive graphs as well as conventional benchmarks studied in previous works. RedLS exhibits very good performance and robustness. It significantly outperforms previous algorithms on all benchmarks.

An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem

2015 ◽  
pp. 2002-2015
Author(s):  
Meriem Bensouyad ◽  
Nousseiba Guidoum ◽  
Djamel-Eddine Saïdouni
Keyword(s):  
Combinatorial Optimization ◽  
Evolutionary Algorithm ◽  
Graph Coloring ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
New Approach ◽  
Coloring Problem ◽  
Graph Coloring Problem ◽  
First Time ◽  
General Graphs

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.

An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem

2014 ◽  
Vol 5 (2) ◽  
pp. 22-36 ◽  
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.

A Metaheuristic Algorithm to Face the Graph Coloring Problem

2020 ◽  
pp. 195-208
Author(s):  
A. Guzmán-Ponce ◽  
J. R. Marcial-Romero ◽  
R. M. Valdovinos ◽  
R. Alejo ◽  
E. E. Granda-Gutiérrez
Keyword(s):  
Graph Coloring ◽  
Metaheuristic Algorithm ◽  
Coloring Problem ◽  
Graph Coloring Problem
Sign in / Sign up

Export Citation Format

Share Document