Self-adaptive differential evolution with global neighborhood search

Differential evolution (DE) is a simple yet efficient stochastic search approach for numerical optimization. However, it tends to suffer from slow convergence when tackling complicated problems. In addition, its search ability is significantly influenced by its control parameters. To improve the performance of the basic DE, this paper proposes a self-adaptive differential evolution with global neighborhood search (NSSDE). In the proposed NSSDE, its control parameters are self-adaptively tuned according to the feedback from the search process, while the global neighborhood search strategy is incorporated to accelerate the convergence speed. To evaluate the performance of the proposed NSSDE, we compare it with several DE variants on a set of benchmark test functions. The experimental results show that NSSDE can achieve better results than its competitors on the majority of the benchmark test functions.