Molecular Geometry Optimization with a Genetic Algorithm
- 10 July 1995
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 75 (2), 288-291
- https://doi.org/10.1103/physrevlett.75.288
Abstract
We present a method for reliably determining the lowest energy structure of an atomic cluster in an arbitrary model potential. The method is based on a genetic algorithm, which operates on a population of candidate structures to produce new candidates with lower energies. Our method dramatically outperforms simulated annealing, which we demonstrate by applying the genetic algorithm to a tight-binding model potential for carbon. With this potential, the algorithm efficiently finds fullerene cluster structures up to starting from random atomic coordinates.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Application of genetic algorithms in molecular modelingJournal of Computational Chemistry, 1994
- Genetic algorithm: a new approach to the prediction of the structure of molecular clustersChemical Physics Letters, 1993
- Energy minimization in binary alloy models via genetic algorithmsComputer Physics Communications, 1992
- A transferable tight-binding potential for carbonJournal of Physics: Condensed Matter, 1992
- Structures of large fullerenes: C60 to C94Chemical Physics Letters, 1992
- Growth regimes of carbon clustersPhysical Review Letters, 1991
- Simulated annealing of carbon clustersPhysical Review B, 1990
- Computational complexity of the ground-state determination of atomic clustersJournal of Physics A: General Physics, 1985
- A Monte carlo simulated annealing approach to optimization over continuous variablesJournal of Computational Physics, 1984
- Optimization by Simulated AnnealingScience, 1983