arrow
返回

Gradient Gravitational Search: An Efficient Metaheuristic Algorithm for Global Optimization

delete2015-03-17
delete14
PRE
AI
T
Tirtharaj Dash
P
Prabhat K. Sahu *
DOI:10.1002/jcc.23891delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
gradient gravitational search
global optimization
metaheuristic
protein folding
potential energy
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Computational Chemistry 封面图
Journal of Computational Chemistry
IF:
4.8
论文数:
7.1K
被引数:
6.1W

机构

N
national institute of science & technology (nist)
学者数:
102
论文数: 84
被引数: 0
引用论文

引用论文

Virulence and transmission modes of two microsporidia inDaphnia magna
err2009-04-06
err0
PREAI
errK. L. Mangin; M. Lipsitch; D. Ebert
err分享
err收藏
err分享
err收藏
学者 查看更多内容