An investigation of two approaches to basin hopping minimization for atomic and molecular clusters
Chemical Physics LettersPublished 1 June 1998
Ronald P. White, Howard R. Mayne
Citations63
SJR quartileQ2
SJR score0.55
SNIP0.69
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We have carried out potential energy minimization searches for atomic and molecular clusters using two variants of the basin hopping strategy. We find that the significant structures basin hopping (SSBH) performs better than the raw structures basin hopping (RSBH) when both use optimized step sizes. The SSBH was able to locate previously-identified global minima for (LJ)n (n=19, 30, 38) and (benzene)n (n=6, 10) The (benzene)14 cluster minimum presented here is a new result.
Keywords
Materials SciencePhysics and Astronomy
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The Journal of Physical Chemistry AGlobal Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
2,996 Citations1997David J. Wales, Jonathan P. K. Doye
Proceedings of the National Academy of SciencesMonte Carlo-minimization approach to the multiple-minima problem in protein folding.
1,478 Citations1987Zhi Li, Harold A. Scheraga
The Monte Carlo-minimization method has located the lowest-energy minimum thus far reported for the brain pentapeptide [Met5]enkephalin in the absence of water, presumably it is the global minimum-energy structure.
Physical Review LettersMolecular Geometry Optimization with a Genetic Algorithm
1,143 Citations1995D. M. Deaven, K. M. Ho
This work presents a method for reliably determining the lowest energy structure of an atomic cluster in an arbitrary model potential, based on a genetic algorithm that operates on a population of candidate structures to produce new candidates with lower energies.
The Journal of Chemical PhysicsA random-walk simulation of the Schrödinger equation: H+3
955 Citations1975James B. Anderson
Monte Carlo Methods
666 Citations2008Malvin H. Kalos
Simulations of Stochastic Systems: Radiation Transport and Monte Carlo Evaluation of Finite-Dimensional Integrals show random walks, Integral Equations, and Variance Reduction in addition to classical Monte Carlo methods.
Chemical Physics LettersQuantum annealing: A new method for minimizing multidimensional functions
646 Citations1994A.B. Finnila, M.A. Gomez +3 more
The technique is applied to the problem of finding the lowest energy configurations of Lennard-Jones clusters of up to 19 particles and early success suggests that this method may complement the widely implemented technique of simulated annealing.
The Journal of Chemical PhysicsStructure and binding of Lennard-Jones clusters: 13≤<i>N</i>≤147
468 Citations1987J. A. Northby
Chemical Physics LettersGlobal minima of water clusters (H2O) , n≤21, described by an empirical potential
429 Citations1998David J. Wales, Matthew P. Hodges
The Journal of Chemical PhysicsReducing quasi-ergodic behavior in Monte Carlo simulations by <i>J</i>-walking: Applications to atomic clusters
308 Citations1990D. D. Frantz, David L. Freeman +1 more
Journal of Computational ChemistryNew optimization method for conformational energy calculations on polypeptides: Conformational space annealing
301 Citations1997Jooyoung Lee, Harold A. Scheraga +1 more
The Journal of Physical ChemistryGlobal geometry optimization of clusters using genetic algorithms
281 Citations1993Bernd Hartke
With the number of potential energy function evaluations as a measure, the genetic algorithm is more economical than either a set of traditional, local minimizations or a molecular dynamics simulated annealing approach.
The Journal of Physical ChemistryPerformance of the diffusion equation method in searches for optimum structures of clusters of Lennard-Jones atoms
148 Citations1991Jarosław Kostrowicki, Lucjan Piela +2 more
The Journal of Chemical PhysicsA global optimization approach for Lennard-Jones microclusters
140 Citations1992Costas D. Maranas, Christodoulos A. Floudas
A global optimization approach is proposed for finding the global minimum energy configuration of Lennard‐Jones microclusters via a novel procedure performed for each pair potential that constitute the total potential energy function.
The Journal of Chemical PhysicsGlobal geometry optimization of atomic clusters using a modified genetic algorithm in space-fixed coordinates
136 Citations1996J. A. Niesse, Howard R. Mayne
The genetic algo is recast as a deterministic/stochastic genetic algorithm (DS‐GA) with stochastic part is a traditional GA, with the manipulations being carried out on binary‐coded internal coordinates (atom–atom distances).
Reviews in computational chemistryA Survey of Methods for Searching the Conformational Space of Small and Medium‐Sized Molecules
130 Citations1991Andrew R. Leach
The Journal of Chemical PhysicsGlobal geometry optimization of (Ar)<i>n</i> and B(Ar)<i>n</i> clusters using a modified genetic algorithm
125 Citations1996Susan Gregurick, Millard H. Alexander +1 more
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsPrediction of the lowest energy structure of clusters using a genetic algorithm
124 Citations1995Yehuda Zeiri
The Journal of Physical ChemistryGlobal energy minimum searches using an approximate solution of the imaginary time Schroedinger equation
121 Citations1993Patricia Amara, David Hsu +1 more
The Journal of Chemical PhysicsA study of genetic algorithm approaches to global geometry optimization of aromatic hydrocarbon microclusters
60 Citations1998Ronald P. White, J. A. Niesse +1 more
The primary purpose was to examine several techniques which use concepts from the field of genetic algorithms (GA) and find the SFMGA, the space-fixed modified GA, to be superior to SA, and comparable to BH.
The Journal of Chemical PhysicsComparison study of pivot methods for global optimization
47 Citations1997Pablo Serra, Aaron Stanton +2 more
Two implementations of a new algorithm called the pivot method for the location of the global minimum of a multiple minima problem are compared and it appears that the nearest neighbor pivot method using the generalized q-distribution is sup...
Journal of Computational ChemistryEnergy minimization of mixed argon-xenon microclusters using a genetic algorithm
44 Citations1997Wayne Pullan
Using appropriate genetic operators, the genetic algorithm was able to find minimum energy structures for microclusters of two to twenty atoms, in all possible combinations of argon and xenon.
The Journal of Chemical PhysicsNew conformational search method based on local torsional deformations for cyclic molecules, loops in proteins, and dense polymer systems
25 Citations1996Canan Baysal, Hagai Meirovitch
The Journal of Chemical PhysicsSimulated annealing using coarse grained classical dynamics: Smoluchowski dynamics in the Gaussian density approximation
24 Citations1995John E. Straub, Jianpeng Ma +1 more
Computers in PhysicsFinding the needle in the haystack: Algorithms for conformational optimization
23 Citations1996Ioan Andricioaei, John E. Straub
Algorithms are given for comformational optimization of proteins, where finding the lowest‐energy conformation in a many‐dimensional configuration space becomes a computationally demanding problem.
The Journal of Physical ChemistryNovel approach for computing the global minimum of proteins. 2. One-dimensional test cases
14 Citations1991M. Sylvain, R. L. Somorjai
