A Modified Binary Crow Search Algorithm for Solving the Graph Coloring Problem

Abstract

The graph coloring problem (GCP) is a well-known classical combinatorial optimization problem in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. This article proposes a modified binary crow search algorithm (MBCSA) to solve the graph coloring problem. First, the binary crow search algorithm is obtained from the original crow search algorithm using the V-shaped transfer function and the discretization method. Second, we use chaotic maps to choose the right values of the flight length (FL) and the awareness probability (AP). Third, we adopt the Gaussian distribution method to replace the random variables used for updating the position of the crows. The aim of these contributions is to avoid the premature convergence to local optima and ensure the diversity of the solutions. To evaluate the performance of our algorithm, we use the well-known DIMACS benchmark graph coloring instances. The simulation results reveal the efficiency of our proposed algorithm in comparison with other existing algorithms in the literature.