A new Method for Solving of the Graph Coloring Problem a Based on Fuzzy Logic and Whale Optimization Algorithm

In recent years, Graph Coloring Problem (GCP) is one of the main optimization problems from literature. Many real world problems interacting with changing environments can be modeled by dynamic graphs. Graph vertex coloring with a given number of colors is a wellknown and much-studied NP-hard problem. Meta-heuristic algorithms are a good choice to solve GCP because they are suitable for problems with NP-hard complexity. But, in many previously proposed algorithms, there are common problems such as runtime algorithm and low convergence of algorithm. Therefore, in this paper, we propose the Fuzzy Whale Optimization Algorithm (FWOA), a variety of basic Whale Optimization Algorithm (WOA), to improve runtime and convergence of algorithm in the GCP. Since WOA at first was introduced to solve continue problem, we need a discrete WOA. Hence, to use FWOA to discrete search space, the standard arithmetic operators such as addition, subtraction and multiplication extant in FWOA encircling prey, exploitation phase and exploration phase operators based on distance’s theory needs to be redefined in the discrete space. Parameters p, r are defined randomly in the WOA algorithm in FWOA algorithm defined as fuzzy and are selected in fuzzy tragedy. A set of graph coloring benchmark problems are solved and its performance is compared with some well-known heuristic search methods. Results illustrate that FWOA algorithm is the original focus of this work in most cases success rate is nearly 100% and the runtime and convergence algorithm has been improved on some graphs. But as we have illustrated that compared with other manners, we cannot deduce that our algorithm is the best in all instance of graphs. It can be said that a proposed algorithm is able to compete with other algorithms in this context. Obtained results approved high performance of proposed method.