Application of genetic algorithms in nanoscience: Cluster geometry optimization

12Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An account is presented of the design and application of Genetic Algorithms for the geometry optimization (energy minimization) of clusters and nanoparticles, where the interactions between atoms, ions or molecules are described by a variety of potential energy functions (force fields). Adetailed description is presented of the Birmingham Cluster Genetic Algorithm Program, developed in our group, and two specific applications are highlighted: the use of a GAto optimize the geometry and atom distribution in mixed Cu-Au clusters; and the use of an energy predator in an attempt to identify the lowest six isomers of C40. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Johnston, R. L., Mortimer-Jones, T. V., Roberts, C., Darby, S., & Manby, F. R. (2002). Application of genetic algorithms in nanoscience: Cluster geometry optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2279 LNCS, pp. 92–101). Springer Verlag. https://doi.org/10.1007/3-540-46004-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free