A discrete flower pollination algorithm for graph coloring problem

摘要

Flower pollination algorithm is a recent nature inspired algorithm for continuous optimization; this algorithm is inspired by the pollination process of flowers. In this paper, we introduce a discrete version of the algorithm to deal with the graph coloring problem. The performance of the algorithm is evaluated on benchmark instances set and the computational results show promising results where it achieves the exact solution in almost cases.