Bernstein-Levy differential evolution algorithm for numerical function optimization


Civicioglu P., BEŞDOK E.

Neural Computing and Applications, vol.35, no.9, pp.6603-6621, 2023 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 35 Issue: 9
  • Publication Date: 2023
  • Doi Number: 10.1007/s00521-022-08013-7
  • Journal Name: Neural Computing and Applications
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Applied Science & Technology Source, Biotechnology Research Abstracts, Compendex, Computer & Applied Sciences, Index Islamicus, INSPEC, zbMATH
  • Page Numbers: pp.6603-6621
  • Keywords: Differential evolution algorithm, Viewshed analysis, Hyperspectral imaging, Radio coverage maximization, IMPULSIVE NOISE SUPPRESSION, SEARCH ALGORITHM, IMAGES
  • Kayseri University Affiliated: No

Abstract

© 2022, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.Differential evolutionary (DE) algorithm is one of the most frequently used evolutionary computation method for the solution of non-differentiable, complex and discontinuous real value numerical problems. The analytical structure of the mutation and crossover operators used by DE and the initial values of the parameters of the relevant operators affect the problem-solving ability of DE. Unfortunately, there is no analytical method for selecting and initializing the best artificial genetic operators that DE can use to solve a problem. Therefore, there is a need to develop new evolutionary search methods that are parameter-free and insensitive to the artificial genetic operators they use. In this paper, the Bernstein–Levy differential evolution (BDE) algorithm, which has a unique elitist-mutation operator and a Bernstein polynomials-based stochastic parameter-free crossover operator, is introduced. The numerical problem-solving success of BDE is statistically evaluated by using 30 benchmark problems of CEC2014 in the numerical experiments presented. BDE's success in solving the related benchmark problems is statistically compared with six state-of-the-art comparison algorithms. In this paper, three real-world optimization problems are also solved by using the proposed algorithm, BDE. According to statistics generated from the experimental results, BDE is statistically better than comparison methods in solving the related real-world problems.