Stochastic leader gravitational search algorithm for enhanced adaptive beamforming technique

Soodabeh Darzi, Mohammad Tariqul Islam, Sieh Kiong Tiong, Salehin Kibria, Mandeep Singh

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, stochastic leader gravitational search algorithm (SL-GSA) based on randomized k is proposed. Standard GSA (SGSA) utilizes the best agents without any randomization, thus it is more prone to converge at suboptimal results. Initially, the new approach randomly choses k agents from the set of all agents to improve the global search ability. Gradually, the set of agents is reduced by eliminating the agents with the poorest performances to allow rapid convergence. The performance of the SL-GSA was analyzed for six well-known benchmark functions, and the results are compared with SGSA and some of its variants. Furthermore, the SLGSA is applied to minimum variance distortionless response (MVDR) beamforming technique to ensure compatibility with real world optimization problems. The proposed algorithmdemonstrates superior convergence rate and quality of solution for both real world problems and benchmark functions compared to original algorithm and other recent variants of SGSA.

Original languageEnglish
Article numbere0140526
JournalPLoS ONE
Volume10
Issue number11
DOIs
Publication statusPublished - 09 Nov 2015

Fingerprint

Beamforming
Benchmarking
system optimization
Random Allocation
methodology

All Science Journal Classification (ASJC) codes

  • Biochemistry, Genetics and Molecular Biology(all)
  • Agricultural and Biological Sciences(all)

Cite this

Darzi, Soodabeh ; Islam, Mohammad Tariqul ; Tiong, Sieh Kiong ; Kibria, Salehin ; Singh, Mandeep. / Stochastic leader gravitational search algorithm for enhanced adaptive beamforming technique. In: PLoS ONE. 2015 ; Vol. 10, No. 11.
@article{d0dc8c4d0dfc4c39bd46260713df2778,
title = "Stochastic leader gravitational search algorithm for enhanced adaptive beamforming technique",
abstract = "In this paper, stochastic leader gravitational search algorithm (SL-GSA) based on randomized k is proposed. Standard GSA (SGSA) utilizes the best agents without any randomization, thus it is more prone to converge at suboptimal results. Initially, the new approach randomly choses k agents from the set of all agents to improve the global search ability. Gradually, the set of agents is reduced by eliminating the agents with the poorest performances to allow rapid convergence. The performance of the SL-GSA was analyzed for six well-known benchmark functions, and the results are compared with SGSA and some of its variants. Furthermore, the SLGSA is applied to minimum variance distortionless response (MVDR) beamforming technique to ensure compatibility with real world optimization problems. The proposed algorithmdemonstrates superior convergence rate and quality of solution for both real world problems and benchmark functions compared to original algorithm and other recent variants of SGSA.",
author = "Soodabeh Darzi and Islam, {Mohammad Tariqul} and Tiong, {Sieh Kiong} and Salehin Kibria and Mandeep Singh",
year = "2015",
month = "11",
day = "9",
doi = "10.1371/journal.pone.0140526",
language = "English",
volume = "10",
journal = "PLoS One",
issn = "1932-6203",
publisher = "Public Library of Science",
number = "11",

}

Stochastic leader gravitational search algorithm for enhanced adaptive beamforming technique. / Darzi, Soodabeh; Islam, Mohammad Tariqul; Tiong, Sieh Kiong; Kibria, Salehin; Singh, Mandeep.

In: PLoS ONE, Vol. 10, No. 11, e0140526, 09.11.2015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Stochastic leader gravitational search algorithm for enhanced adaptive beamforming technique

AU - Darzi, Soodabeh

AU - Islam, Mohammad Tariqul

AU - Tiong, Sieh Kiong

AU - Kibria, Salehin

AU - Singh, Mandeep

PY - 2015/11/9

Y1 - 2015/11/9

N2 - In this paper, stochastic leader gravitational search algorithm (SL-GSA) based on randomized k is proposed. Standard GSA (SGSA) utilizes the best agents without any randomization, thus it is more prone to converge at suboptimal results. Initially, the new approach randomly choses k agents from the set of all agents to improve the global search ability. Gradually, the set of agents is reduced by eliminating the agents with the poorest performances to allow rapid convergence. The performance of the SL-GSA was analyzed for six well-known benchmark functions, and the results are compared with SGSA and some of its variants. Furthermore, the SLGSA is applied to minimum variance distortionless response (MVDR) beamforming technique to ensure compatibility with real world optimization problems. The proposed algorithmdemonstrates superior convergence rate and quality of solution for both real world problems and benchmark functions compared to original algorithm and other recent variants of SGSA.

AB - In this paper, stochastic leader gravitational search algorithm (SL-GSA) based on randomized k is proposed. Standard GSA (SGSA) utilizes the best agents without any randomization, thus it is more prone to converge at suboptimal results. Initially, the new approach randomly choses k agents from the set of all agents to improve the global search ability. Gradually, the set of agents is reduced by eliminating the agents with the poorest performances to allow rapid convergence. The performance of the SL-GSA was analyzed for six well-known benchmark functions, and the results are compared with SGSA and some of its variants. Furthermore, the SLGSA is applied to minimum variance distortionless response (MVDR) beamforming technique to ensure compatibility with real world optimization problems. The proposed algorithmdemonstrates superior convergence rate and quality of solution for both real world problems and benchmark functions compared to original algorithm and other recent variants of SGSA.

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

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

U2 - 10.1371/journal.pone.0140526

DO - 10.1371/journal.pone.0140526

M3 - Article

VL - 10

JO - PLoS One

JF - PLoS One

SN - 1932-6203

IS - 11

M1 - e0140526

ER -