Bernstain-Search Differential Evolution Algorithm
Updated 07 Aug 2019
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.
Civicioğlu P., Besdok E., Bernstain-Search Differential Evolution Algorithm for Numerical Function Optimization, Expert Systems with Applications, Available online 24 July 2019, 112831, https://doi.org/10.1016/j.eswa.2019.112831 (In Press, Accepted Manuscript). please see for the manuscript : https://www.sciencedirect.com/science/article/pii/S0957417419305330
MATLAB Release Compatibility
Platform CompatibilityWindows macOS Linux
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!