.png){kind=icon}
Return
Gradient Gravitational Search: An Efficient Metaheuristic Algorithm for Global Optimization
.png){kind=icon}
PRE
AI
DOI：10.1002/jcc.23891.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The adaptation of novel techniques developed in the field of computational chemistry to solve the concerned problems for large and flexible molecules is taking the center stage with regard to efficient algorithm, computational cost and accuracy. In this article, the gradient-based gravitational search (GGS) algorithm, using analytical gradients for a fast minimization to the next local minimum has been reported. Its efficiency as metaheuristic approach has also been compared with Gradient Tabu Search and others like: Gravitational Search, Cuckoo Search, and Back Tracking Search algorithms for global optimization. Moreover, the GGS approach has also been applied to computational chemistry problems for finding the minimal value potential energy of two-dimensional and three-dimensional off-lattice protein models. The simulation results reveal the relative stability and physical accuracy of protein models with efficient computational cost. (c) 2015 Wiley Periodicals, Inc.
Keywords:
gradient gravitational search
global optimization
metaheuristic
protein folding
potential energy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
7.1K
Citations:
6.1W
Organization
Cited Papers
An improved co-evolutionary particle swarm optimization for wireless sensor networks with dynamic deployment.png)
SENSORS
OAAI
SENSORSIF3.5
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
View more