A comparative study of discrete differential evolution on binary constraint satisfaction problems

There are some variants and applications of the discretization of differential evolution. Performances of discrete differential evolution algorithms on random binary constraint satisfaction problem are studied in this paper, and a novel discrete differential evolution algorithm based on exchanging elements is proposed. We compare the proposed discrete differential evolution, evolutionary algorithms and discrete particle swarm optimization on random binary constraint satisfaction problems. Experimental results indicate though the proposed algorithm is simpler, it is competitive with other evolutionary algorithms solving constraint satisfaction problems.