A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming

Soodabeh Darzi, Tiong Sieh Kiong, Mohammad Tariqul Islam, Hassan Rezai Soleymanpour, Salehin Kibria

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

This paper introduces a memory-based version of gravitational search algorithm (MBGSA) to improve the beamforming performance by preventing loss of optimal trajectory. The conventional gravitational search algorithm (GSA) is a memory-less heuristic optimization algorithm based on Newton's laws of gravitation. Therefore, the positions of agents only depend on the optimal solutions of previous iteration. In GSA, there is always a chance to lose optimal trajectory because of not utilizing the best solution from previous iterations of the optimization process. This drawback reduces the performance of GSA when dealing with complicated optimization problems. However, the MBGSA uses the overall best solution of the agents from previous iterations in the calculation of agents’ positions. Consequently, the agents try to improve their positions by always searching around overall best solutions. The performance of the MBGSA is evaluated by solving fourteen standard benchmark optimization problems and the results are compared with GSA and modified GSA (MGSA). It is also applied to adaptive beamforming problems to improve the weight vectors computed by Minimum Variance Distortionless Response (MVDR) algorithm as a real world optimization problem. The proposed algorithm demonstrates high performance of convergence compared to GSA and Particle Swarm Optimization (PSO).

Original languageEnglish
Pages (from-to)103-118
Number of pages16
JournalApplied Soft Computing Journal
Volume47
DOIs
Publication statusPublished - 1 Oct 2016

Fingerprint

Beamforming
Data storage equipment
Trajectories
Particle swarm optimization (PSO)
Gravitation

Keywords

  • Adaptive beamforming
  • Artificial intelligence
  • Gravitational search algorithm
  • Heuristic algorithm
  • Minimum variance distortionless response
  • Particle Swarm Optimization

ASJC Scopus subject areas

  • Software

Cite this

A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming. / Darzi, Soodabeh; Sieh Kiong, Tiong; Islam, Mohammad Tariqul; Rezai Soleymanpour, Hassan; Kibria, Salehin.

In: Applied Soft Computing Journal, Vol. 47, 01.10.2016, p. 103-118.

Research output: Contribution to journalArticle

Darzi, Soodabeh ; Sieh Kiong, Tiong ; Islam, Mohammad Tariqul ; Rezai Soleymanpour, Hassan ; Kibria, Salehin. / A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming. In: Applied Soft Computing Journal. 2016 ; Vol. 47. pp. 103-118.
@article{80db4902befc4585a84ba94820023d0b,
title = "A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming",
abstract = "This paper introduces a memory-based version of gravitational search algorithm (MBGSA) to improve the beamforming performance by preventing loss of optimal trajectory. The conventional gravitational search algorithm (GSA) is a memory-less heuristic optimization algorithm based on Newton's laws of gravitation. Therefore, the positions of agents only depend on the optimal solutions of previous iteration. In GSA, there is always a chance to lose optimal trajectory because of not utilizing the best solution from previous iterations of the optimization process. This drawback reduces the performance of GSA when dealing with complicated optimization problems. However, the MBGSA uses the overall best solution of the agents from previous iterations in the calculation of agents’ positions. Consequently, the agents try to improve their positions by always searching around overall best solutions. The performance of the MBGSA is evaluated by solving fourteen standard benchmark optimization problems and the results are compared with GSA and modified GSA (MGSA). It is also applied to adaptive beamforming problems to improve the weight vectors computed by Minimum Variance Distortionless Response (MVDR) algorithm as a real world optimization problem. The proposed algorithm demonstrates high performance of convergence compared to GSA and Particle Swarm Optimization (PSO).",
keywords = "Adaptive beamforming, Artificial intelligence, Gravitational search algorithm, Heuristic algorithm, Minimum variance distortionless response, Particle Swarm Optimization",
author = "Soodabeh Darzi and {Sieh Kiong}, Tiong and Islam, {Mohammad Tariqul} and {Rezai Soleymanpour}, Hassan and Salehin Kibria",
year = "2016",
month = "10",
day = "1",
doi = "10.1016/j.asoc.2016.05.045",
language = "English",
volume = "47",
pages = "103--118",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - A memory-based gravitational search algorithm for enhancing minimum variance distortionless response beamforming

AU - Darzi, Soodabeh

AU - Sieh Kiong, Tiong

AU - Islam, Mohammad Tariqul

AU - Rezai Soleymanpour, Hassan

AU - Kibria, Salehin

PY - 2016/10/1

Y1 - 2016/10/1

N2 - This paper introduces a memory-based version of gravitational search algorithm (MBGSA) to improve the beamforming performance by preventing loss of optimal trajectory. The conventional gravitational search algorithm (GSA) is a memory-less heuristic optimization algorithm based on Newton's laws of gravitation. Therefore, the positions of agents only depend on the optimal solutions of previous iteration. In GSA, there is always a chance to lose optimal trajectory because of not utilizing the best solution from previous iterations of the optimization process. This drawback reduces the performance of GSA when dealing with complicated optimization problems. However, the MBGSA uses the overall best solution of the agents from previous iterations in the calculation of agents’ positions. Consequently, the agents try to improve their positions by always searching around overall best solutions. The performance of the MBGSA is evaluated by solving fourteen standard benchmark optimization problems and the results are compared with GSA and modified GSA (MGSA). It is also applied to adaptive beamforming problems to improve the weight vectors computed by Minimum Variance Distortionless Response (MVDR) algorithm as a real world optimization problem. The proposed algorithm demonstrates high performance of convergence compared to GSA and Particle Swarm Optimization (PSO).

AB - This paper introduces a memory-based version of gravitational search algorithm (MBGSA) to improve the beamforming performance by preventing loss of optimal trajectory. The conventional gravitational search algorithm (GSA) is a memory-less heuristic optimization algorithm based on Newton's laws of gravitation. Therefore, the positions of agents only depend on the optimal solutions of previous iteration. In GSA, there is always a chance to lose optimal trajectory because of not utilizing the best solution from previous iterations of the optimization process. This drawback reduces the performance of GSA when dealing with complicated optimization problems. However, the MBGSA uses the overall best solution of the agents from previous iterations in the calculation of agents’ positions. Consequently, the agents try to improve their positions by always searching around overall best solutions. The performance of the MBGSA is evaluated by solving fourteen standard benchmark optimization problems and the results are compared with GSA and modified GSA (MGSA). It is also applied to adaptive beamforming problems to improve the weight vectors computed by Minimum Variance Distortionless Response (MVDR) algorithm as a real world optimization problem. The proposed algorithm demonstrates high performance of convergence compared to GSA and Particle Swarm Optimization (PSO).

KW - Adaptive beamforming

KW - Artificial intelligence

KW - Gravitational search algorithm

KW - Heuristic algorithm

KW - Minimum variance distortionless response

KW - Particle Swarm Optimization

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

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

U2 - 10.1016/j.asoc.2016.05.045

DO - 10.1016/j.asoc.2016.05.045

M3 - Article

VL - 47

SP - 103

EP - 118

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -