Gravitational swarm optimizer for global optimization

Anupam Yadav, Kusum Deep, Joong Hoon Kim, Atulya K. Nagar

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

In this paper, a new meta-heuristic method is proposed by combining Particle Swarm Optimization (PSO) and gravitational search in a coherent way. The advantage of swarm intelligence and the idea of a force of attraction between two particles are employed collectively to propose an improved meta-heuristic method for constrained optimization problems. Excellent constraint handling is always required for the success of any constrained optimizer. In view of this, an improved constraint-handling method is proposed which was designed in alignment with the constitutional mechanism of the proposed algorithm. The design of the algorithm is analyzed in many ways and the theoretical convergence of the algorithm is also established in the paper. The efficiency of the proposed technique was assessed by solving a set of 24 constrained problems and 15 unconstrained problems which have been proposed in IEEE-CEC sessions 2006 and 2015, respectively. The results are compared with 11 state-of-the-art algorithms for constrained problems and 6 state-of-the-art algorithms for unconstrained problems. A variety of ways are considered to examine the ability of the proposed algorithm in terms of its converging ability, success, and statistical behavior. The performance of the proposed constraint-handling method is judged by analyzing its ability to produce a feasible population. It was concluded that the proposed algorithm performs efficiently with good results as a constrained optimizer.

Original languageEnglish
Pages (from-to)64-89
Number of pages26
JournalSwarm and Evolutionary Computation
Volume31
DOIs
Publication statusPublished - 2016 Dec 1

Fingerprint

Global optimization
Swarm
Global Optimization
Constraint Handling
Heuristic methods
Heuristic Method
Metaheuristics
Swarm Intelligence
Constrained optimization
Constrained Optimization Problem
Particle swarm optimization (PSO)
Particle Swarm Optimization
Alignment

Keywords

  • Constrained handling
  • Constrained optimization
  • Gravitational Search Algorithm
  • Particle Swarm Optimization
  • Shrinking hypersphere

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Gravitational swarm optimizer for global optimization. / Yadav, Anupam; Deep, Kusum; Kim, Joong Hoon; Nagar, Atulya K.

In: Swarm and Evolutionary Computation, Vol. 31, 01.12.2016, p. 64-89.

Research output: Contribution to journalArticle

Yadav, Anupam ; Deep, Kusum ; Kim, Joong Hoon ; Nagar, Atulya K. / Gravitational swarm optimizer for global optimization. In: Swarm and Evolutionary Computation. 2016 ; Vol. 31. pp. 64-89.
@article{2fc8afe1d10d48b49ab4ee60a9ef2ee6,
title = "Gravitational swarm optimizer for global optimization",
abstract = "In this paper, a new meta-heuristic method is proposed by combining Particle Swarm Optimization (PSO) and gravitational search in a coherent way. The advantage of swarm intelligence and the idea of a force of attraction between two particles are employed collectively to propose an improved meta-heuristic method for constrained optimization problems. Excellent constraint handling is always required for the success of any constrained optimizer. In view of this, an improved constraint-handling method is proposed which was designed in alignment with the constitutional mechanism of the proposed algorithm. The design of the algorithm is analyzed in many ways and the theoretical convergence of the algorithm is also established in the paper. The efficiency of the proposed technique was assessed by solving a set of 24 constrained problems and 15 unconstrained problems which have been proposed in IEEE-CEC sessions 2006 and 2015, respectively. The results are compared with 11 state-of-the-art algorithms for constrained problems and 6 state-of-the-art algorithms for unconstrained problems. A variety of ways are considered to examine the ability of the proposed algorithm in terms of its converging ability, success, and statistical behavior. The performance of the proposed constraint-handling method is judged by analyzing its ability to produce a feasible population. It was concluded that the proposed algorithm performs efficiently with good results as a constrained optimizer.",
keywords = "Constrained handling, Constrained optimization, Gravitational Search Algorithm, Particle Swarm Optimization, Shrinking hypersphere",
author = "Anupam Yadav and Kusum Deep and Kim, {Joong Hoon} and Nagar, {Atulya K.}",
year = "2016",
month = "12",
day = "1",
doi = "10.1016/j.swevo.2016.07.003",
language = "English",
volume = "31",
pages = "64--89",
journal = "Swarm and Evolutionary Computation",
issn = "2210-6502",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - Gravitational swarm optimizer for global optimization

AU - Yadav, Anupam

AU - Deep, Kusum

AU - Kim, Joong Hoon

AU - Nagar, Atulya K.

PY - 2016/12/1

Y1 - 2016/12/1

N2 - In this paper, a new meta-heuristic method is proposed by combining Particle Swarm Optimization (PSO) and gravitational search in a coherent way. The advantage of swarm intelligence and the idea of a force of attraction between two particles are employed collectively to propose an improved meta-heuristic method for constrained optimization problems. Excellent constraint handling is always required for the success of any constrained optimizer. In view of this, an improved constraint-handling method is proposed which was designed in alignment with the constitutional mechanism of the proposed algorithm. The design of the algorithm is analyzed in many ways and the theoretical convergence of the algorithm is also established in the paper. The efficiency of the proposed technique was assessed by solving a set of 24 constrained problems and 15 unconstrained problems which have been proposed in IEEE-CEC sessions 2006 and 2015, respectively. The results are compared with 11 state-of-the-art algorithms for constrained problems and 6 state-of-the-art algorithms for unconstrained problems. A variety of ways are considered to examine the ability of the proposed algorithm in terms of its converging ability, success, and statistical behavior. The performance of the proposed constraint-handling method is judged by analyzing its ability to produce a feasible population. It was concluded that the proposed algorithm performs efficiently with good results as a constrained optimizer.

AB - In this paper, a new meta-heuristic method is proposed by combining Particle Swarm Optimization (PSO) and gravitational search in a coherent way. The advantage of swarm intelligence and the idea of a force of attraction between two particles are employed collectively to propose an improved meta-heuristic method for constrained optimization problems. Excellent constraint handling is always required for the success of any constrained optimizer. In view of this, an improved constraint-handling method is proposed which was designed in alignment with the constitutional mechanism of the proposed algorithm. The design of the algorithm is analyzed in many ways and the theoretical convergence of the algorithm is also established in the paper. The efficiency of the proposed technique was assessed by solving a set of 24 constrained problems and 15 unconstrained problems which have been proposed in IEEE-CEC sessions 2006 and 2015, respectively. The results are compared with 11 state-of-the-art algorithms for constrained problems and 6 state-of-the-art algorithms for unconstrained problems. A variety of ways are considered to examine the ability of the proposed algorithm in terms of its converging ability, success, and statistical behavior. The performance of the proposed constraint-handling method is judged by analyzing its ability to produce a feasible population. It was concluded that the proposed algorithm performs efficiently with good results as a constrained optimizer.

KW - Constrained handling

KW - Constrained optimization

KW - Gravitational Search Algorithm

KW - Particle Swarm Optimization

KW - Shrinking hypersphere

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

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

U2 - 10.1016/j.swevo.2016.07.003

DO - 10.1016/j.swevo.2016.07.003

M3 - Article

AN - SCOPUS:84995545592

VL - 31

SP - 64

EP - 89

JO - Swarm and Evolutionary Computation

JF - Swarm and Evolutionary Computation

SN - 2210-6502

ER -