A Discrete Artificial Bee Colony Algorithm Based on Similarity for Graph Coloring Problems.

In this paper, a novel non-hybrid discrete artificial bee colony (ABC) algorithm is proposed for solving planar graph coloring problems. The original ABC intends to handle only continuous optimization problems. To apply ABC to discrete problems, the original ABC operators need to be redefined over discrete space. In this work, a new algorithm based on Similarity is introduced. Compared with HDPSO, the experiment shows that the proposed method matches the competitive results and obtains higher success rate and lower average evaluation times when solving planar graph coloring problems.