.png){kind=icon}
.png){kind=icon}
Return
SCGSA: A sine chaotic gravitational search algorithm for continuous optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2019.113118.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Gravitational search algorithm (GSA), as one of the novel meta-heuristic optimization algorithms inspired by the law of gravity and mass interactions, is however prone to local optima stagnation due to heavier gravity. Hence, an enhanced version, chaotic gravitational constants for the gravitational search algorithm (CGSA), was proposed to improve the exploration ability through various chaotic maps. In this paper, with insightful utilization of sine cosine algorithm, we put forward sine chaotic gravitational search algorithm (SCGSA) as a further step of CGSA to escape from its local optima stagnation. The experiments show remarkable results in both the speed of convergence and the ability of finding global optima in 30 benchmark functions (CEC 2014), thus proving a better balance between exploration and exploitation in SCGSA compared with CGSA. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
Gravitational search algorithm
Chaotic maps
Sine cosine algorithm
Continuous optimization problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W