NERS_HEAD: a new hybrid evolutionary algorithm for solving graph coloring problem

The graph coloring problem is an NP-hard problem. Currently, one of the most effective methods to solve this a hybrid evolutionary algorithm. This paper proposes algorithm NERS_HEAD with new elite replacement strategy. In NERS_HEAD, method detect local optimal state proposed so that process can jump out by introducing diversity on time; structure and strategy are designed increase population evolution not only converge quickly but also in time. comparison experiments current excellent algorithms 59 DIMACS benchmark instances show effectively improve efficiency success rate solving problems.