Chaotic gravitational constants for the gravitational search algorithm

Seyedali Mirjalili, Amir H. Gandomi

Research output: Contribution to journalArticle

86 Citations (Scopus)

Abstract

In a population-based meta-heuristic, the search process is divided into two main phases: exploration versus exploitation. In the exploration phase, a random behavior is fruitful to explore the search space as extensive as possible. In contrast, a fast exploitation toward the promising regions is the main objective of the latter phase. It is really challenging to find a proper balance between these two phases because of the stochastic nature of population-based meta-heuristic algorithms. The literature shows that chaotic maps are able to improve both phases. This work embeds ten chaotic maps into the gravitational constant (G) of the recently proposed population-based meta-heuristic algorithm called Gravitational Search Algorithm (GSA). Also, an adaptive normalization method is proposed to transit from the exploration phase to the exploitation phase smoothly. As case studies, twelve shifted and biased benchmark functions evaluate the performance of the proposed chaos-based GSA algorithms in terms of exploration and exploitation. A statistical test called Wilcoxon rank-sum is done to judge about the significance of the results as well. The results demonstrate that sinusoidal map is the best map for improving the performance of GSA significantly.

Original languageEnglish
Pages (from-to)407-419
Number of pages13
JournalApplied Soft Computing Journal
Volume53
DOIs
Publication statusPublished - 1 Apr 2017
Externally publishedYes

    Fingerprint

Keywords

  • Chaos theory
  • Chaotic map
  • Gravitational search algorithm
  • Population-based algorithm
  • Sinusoidal map

Cite this