A self-adaptive differential evolution algorithm for binary CSPs

A novel self-adaptive differential evolution (SADE) algorithm is proposed in this paper. SADE adjusts the mutation rate F and the crossover rate CRCR adaptively, taking account of the different distribution of population. In order to balance an individual’s exploration and exploitation capability for different evolving phases, FF and CRCR are equal to two different self-adjusted nonlinear functions. Attention is concentrated on varying FF and CRCR dynamically with each generation evolution. SADE maintains the diversity of population and improves the global convergence ability. It also improves the efficiency and success rate and avoids the premature convergence. Simulation and comparisons based on test-sets of CSPs demonstrate the effectiveness, efficiency and robustness of the proposed algorithm.