| Title of Article |
A Modified Discrete Differential Evolution Algorithm for Solving Graph Coloring Problem |
| Date of Acceptance |
8 March 2022 |
| Journal |
| Title of Journal |
Advances in Dynamical Systems and Applications (ADSA) |
| Standard |
SCOPUS |
| Institute of Journal |
Research India Publications |
| ISBN/ISSN |
0973-5321 |
| Volume |
17 |
| Issue |
1 |
| Month |
|
| Year of Publication |
2022 |
| Page |
331-343 |
| Abstract |
Graph coloring problem (GCP) is a combinatorial optimization problem with many
applications in science and engineering. Because the coloring is sensitive to the order
of vertices and is computationally hard, heuristic search methods on the domain of
permutation of vertices have become a practical solution approach. In this work,
we propose a modified discrete differential algorithm (MDDE) to generate suitable
permutations by improving mutation and crossover operators. The method is tested
and compared with several well-known methods using DIMACS benchmark graphs.
The experimental results show that the proposed MDDE is effective for the graph
coloring problem. |
| Keyword |
Discrete differential evolution algorithm, permutation-based combinatorial optimization problems, graph coloring problem, optimization. |
| Author |
|
| Reviewing Status |
ไม่มีผู้ประเมินอิสระ |
| Status |
ตีพิมพ์แล้ว |
| Level of Publication |
นานาชาติ |
| citation |
true |
| Part of thesis |
true |
| Attach file |
|
| Citation |
0
|
|
|
Publication
Journal Publication
ไทย