Self-adaptive global mine blast algorithm for numerical optimization

  • Yadav, Anupam
  • Sadollah, Ali
  • Yadav, Neha
  • Kim, J. H.
Citations

WEB OF SCIENCE

3
Citations

SCOPUS

4

초록

In this article, a self-adaptive global mine blast algorithm (GMBA) is proposed for numerical optimization. This algorithm is designed in a novel way, and a new shrapnel equation is proposed for the exploitation phase of mine blast algorithm. A theoretical study is performed, which proves the convergence of any typical shrapnel piece; a new definition for parameters values is defined based on the performed theoretical studies. The promising nature of newly designed exploitation idea is verified with the help of multiple numerical experiments. A state-of-the-art set of benchmark problems are solved with the proposed GMBA, and the optimization results are compared with seven state-of-the-art optimization algorithms. The experimental results are statistically validated by using Wilcoxon signed-rank test, and time complexity of GMBA is also calculated. It has been justified that the proposed GMBA works as a global optimizer for constrained optimization problems. As an application to the newly developed GMBA, an important data clustering problem is solved on six data clusters and the clustering results are compared with the state-of-the-art optimization algorithms. The promising results claim the proposed GMBA as a strong optimizer for data clustering application.

키워드

Mine blast algorithmGlobal optimizationConstrained optimizationData clusteringPARTICLE SWARM OPTIMIZATIONDIFFERENTIAL EVOLUTIONSTRATEGY
제목
Self-adaptive global mine blast algorithm for numerical optimization
저자
Yadav, AnupamSadollah, AliYadav, NehaKim, J. H.
DOI
10.1007/s00521-019-04009-y
발행일
2020-04
유형
Article
저널명
Neural Computing and Applications
32
7
페이지
2423 ~ 2444