Bernstain-Search Differential Evolution Algorithm

A new high-performance differential evolution algorithm has been presented.

Parameter setting in standard Differential Evolution Algorithm (DE) is a time-consuming phase since it is based on a trial-and-error process. In this paper, a parameter-free DE algorithm, i.e. Bernstain-Search Differential Evolution Algorithm (BSD), has been proposed for real valued numerical optimization problems. Since BSD's parameter values are determined randomly, it is practically parameter-free. Therefore, the BSD does not have a parameter setting process, contrary to DE and its improved versions. In this paper, 30 benchmark problems of CEC'2014, image evolution problems for 12 test images and one Triangulated Irregular Network (TIN) evolution problem were used in the experiments performed to investigate the problem solving success of BSD, statistically. Four comparison algorithms (i.e., ABC, JADE, CUCKOO, WDE) were used in the conducted experiments. Problem solving successes of BSD and comparison algorithms were statistically compared by using Wilcoxon Signed Rank Test piece wisely. Results obtained from the performed tests showed that in general, problem solving success of BSD is statistically better than the comparison algorithms that have been used in this paper.