Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem

Abstract

Graph coloring problem (GCP) is one of the most studied combinatorial optimization problems. It is important in theory and practice. There have been many algorithms for graph coloring problem, including exact algorithms and (meta-)heuristic algorithms. In this paper, we attempt another meta-heuristic method ¾ particle swarm optimization to graph coloring problem. Particle swarm optimization (PSO) was originally developed for continuous problem. To apply PSO to discrete problem, the standard arithmetic operators of PSO are required to be redefined over discrete space. A conception of distance over discrete solution space is introduced. Under this notion of distance, the PSO operators are redefined. After reinterpreting the composition of velocity of a particle, a general discrete PSO algorithm is proposed. In order to solve graph coloring problem by the discrete PSO algorithm, an algorithm to implement the crucial PSO operator ¾ difference of two positions (solutions) is design ed . Then, a hybrid discrete PSO algorithm for graph coloring problem is propose d by combining a local search. Empirical study of the proposed hybrid algorithm is also carried out based on the second DIMACS challenge benchmarks. The experimental results are competitive with that of other well-known algorithms .