2011
DOI: 10.1021/jp1117695
|View full text |Cite
|
Sign up to set email alerts
|

An Evolutionary Algorithm for the Global Optimization of Molecular Clusters: Application to Water, Benzene, and Benzene Cation

Abstract: We have developed an evolutionary algorithm (EA) for the global minimum search of molecular clusters. The EA is able to discover all the putative global minima of water clusters up to (H(2)O)(20) and benzene clusters up to (C(6)H(6))(30). Then, the EA was applied to search for the global minima structures of (C(6)H(6))(n)(+) with n = 2-20, some of which were theoretically studied for the first time. Our results for n = 2-6 are consistent with previous theoretical work that uses a similar interaction potential.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
109
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 65 publications
(110 citation statements)
references
References 48 publications
(108 reference statements)
1
109
0
Order By: Relevance
“…It was possible to find new global minima for (C 6 H 6 ) 11 , (C 6 H 6 ) 14 , and (C 6 H 6 ) 15 , and the minima for n = 16−30 were first reported. The global minima proposed in ref 24 were confirmed by Llanio-Trujillo et al 25 with a different optimization method.…”
Section: Introductionmentioning
confidence: 69%
“…It was possible to find new global minima for (C 6 H 6 ) 11 , (C 6 H 6 ) 14 , and (C 6 H 6 ) 15 , and the minima for n = 16−30 were first reported. The global minima proposed in ref 24 were confirmed by Llanio-Trujillo et al 25 with a different optimization method.…”
Section: Introductionmentioning
confidence: 69%
“…[22][23][24] Genetic algorithms (GAs) are commonly considered to be an "intelligent" stochastic method as some degree of "learning" occurs through the repeated selection of the fittest individuals, analogous to the process of Darwinian evolution. GAs have been applied to various chemical problems including geometries of transition metal clusters, 25 geometries of molecular clusters, 26 ligand docking, 27 and molecular design. 28 A genetic algorithm begins with a randomly generated set (population) of genomes, each of which has an associated fitness score which is evaluated by some fitness function.…”
Section: Introductionmentioning
confidence: 99%
“…This is easy for relatively small molecules, while it becomes more difficult when molecules are flexible or for relatively large clusters. In the contribution by Marques and coworkers [45], an approach is presented based on an evolutionary algorithm to find minimum energy structures [46], applied here to an aggregation of solvent molecules, aggregates and micro-solvation of ions.…”
Section: (A) Theoretical and Algorithmic Developmentsmentioning
confidence: 99%