Binary bat algorithm for graph coloring problem

Abstract

Bat algorithm (BA) is one of the most recent bio-inspired algorithm. It is based on the echolocation behavior of microbats. The standard BA is proposed only for continuous optimization problems. In this paper, we try to solve the graph coloring problem using a binary bat algorithm. To show the feasibility and the effectiveness of the algorithm, we have used the DIMACS benchmark, and the obtained results are very encouraging.