Self-Adaptive Gravitational Search Algorithm With a Modified Chaotic Local Search

The gravitational search algorithm (GSA) has been proved to yield good performance in solving various optimization problems. However, it is inevitable to suffer from slow exploitation when solving complex problems. In this paper, a thorough empirical analysis of the GSA is performed, which elaborate...

Full description

Saved in:
Bibliographic Details
Published inIEEE access Vol. 5; pp. 17881 - 17895
Main Authors Junkai Ji, Shangce Gao, Shuaiqun Wang, Yajiao Tang, Hang Yu, Todo, Yuki
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.01.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN2169-3536
2169-3536
DOI10.1109/ACCESS.2017.2748957

Cover

More Information
Summary:The gravitational search algorithm (GSA) has been proved to yield good performance in solving various optimization problems. However, it is inevitable to suffer from slow exploitation when solving complex problems. In this paper, a thorough empirical analysis of the GSA is performed, which elaborates the role of the gravitational parameter Gin the optimization process of the GSA. The convergence speed and solution quality are found to be highly sensitive to the value of G. A self-adaptive mechanism is proposed to adjust the value of G automatically, aiming to maintain the balance of exploration and exploitation. To further improve the convergence speed of GSA, we also modify the classic chaotic local search and insert it into the optimization process of the GSA. Through these two techniques, the main weakness of GSA has been overcome effectively, and the obtained results of 23 benchmark functions confirm the excellent performance of the proposed method.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2017.2748957