.png){kind=icon}
Return
Chaos embedded opposition based learning for gravitational search algorithm
.png){kind=icon}
OA
AI
DOI：10.1007/s10489-022-03786-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to its robust search mechanism, Gravitational search algorithm (GSA) has achieved a lot of popularity in different research communities. However, stagnation reduces its searchability towards global optima for rigid and complex multi-modal problems. This paper proposes a GSA variant that incorporates chaos-embedded opposition-based learning into the basic GSA for the stagnation-free search. Additionally, a sine-cosine based chaotic gravitational constant is introduced to balance the trade-off between exploration and exploitation capabilities more effectively. The proposed variant is tested over 23 classical benchmark problems, 15 test problems of CEC 2015 test suite, and 15 test problems of CEC 2014 test suite. Different graphical, as well as empirical analyses, reveal the superiority of the proposed algorithm over conventional meta-heuristics and most recent GSA variants.
Keywords:
Gravitational search algorithm
Chaotic map
Opposition based learning
Meta-heuristics
Stochastic optimization
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more