Self-adaptive global mine blast algorithm for numerical optimization

Anupam Yadav, Ali Sadollah, Neha Yadav, Joong Hoon Kim

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
JournalNeural Computing and Applications
DOIs
Publication statusAccepted/In press - 2019 Jan 1

Fingerprint

Constrained optimization
Experiments

Keywords

  • Constrained optimization
  • Data clustering
  • Global optimization
  • Mine blast algorithm

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this

Self-adaptive global mine blast algorithm for numerical optimization. / Yadav, Anupam; Sadollah, Ali; Yadav, Neha; Kim, Joong Hoon.

In: Neural Computing and Applications, 01.01.2019.

Research output: Contribution to journalArticle

@article{50ab972ee9564a29bfb319ee5703734c,
title = "Self-adaptive global mine blast algorithm for numerical optimization",
abstract = "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.",
keywords = "Constrained optimization, Data clustering, Global optimization, Mine blast algorithm",
author = "Anupam Yadav and Ali Sadollah and Neha Yadav and Kim, {Joong Hoon}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/s00521-019-04009-y",
language = "English",
journal = "Neural Computing and Applications",
issn = "0941-0643",
publisher = "Springer London",

}

TY - JOUR

T1 - Self-adaptive global mine blast algorithm for numerical optimization

AU - Yadav, Anupam

AU - Sadollah, Ali

AU - Yadav, Neha

AU - Kim, Joong Hoon

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Constrained optimization

KW - Data clustering

KW - Global optimization

KW - Mine blast algorithm

UR - http://www.scopus.com/inward/record.url?scp=85060171295&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85060171295&partnerID=8YFLogxK

U2 - 10.1007/s00521-019-04009-y

DO - 10.1007/s00521-019-04009-y

M3 - Article

AN - SCOPUS:85060171295

JO - Neural Computing and Applications

JF - Neural Computing and Applications

SN - 0941-0643

ER -