You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/65436
Title: 
Combining genetic algorithm and simulated annealing: A molecular geometry optimization study
Author(s): 
Institution: 
  • Universidade Estadual Paulista (UNESP)
  • Instituto Tecnológico de Aeronáutica (ITA)
ISSN: 
0166-1280
Abstract: 
We introduce a new hybrid approach to determine the ground state geometry of molecular systems. Firstly, we compared the ability of genetic algorithm (GA) and simulated annealing (SA) to find the lowest energy geometry of silicon clusters with six and 10 atoms. This comparison showed that GA exhibits fast initial convergence, but its performance deteriorates as it approaches the desired global extreme. Interestingly, SA showed a complementary convergence pattern, in addition to high accuracy. Our new procedure combines selected features from GA and SA to achieve weak dependence on initial parameters, parallel search strategy, fast convergence and high accuracy. This hybrid algorithm outperforms GA and SA by one order of magnitude for small silicon clusters (Si6 and Si10). Next, we applied the hybrid method to study the geometry of a 20-atom silicon cluster. It was able to find an original geometry, apparently lower in energy than those previously described in literature. In principle, our procedure can be applied successfully to any molecular system. © 1998 Elsevier Science B.V.
Issue Date: 
14-Apr-1998
Citation: 
Journal of Molecular Structure: THEOCHEM, v. 430, n. 1-3, p. 29-39, 1998.
Time Duration: 
29-39
Keywords: 
  • Genetic algorithm
  • Geometry optimization
  • Silicon cluster
  • Simulated annealing
Source: 
http://dx.doi.org/10.1016/S0166-1280(98)90211-1
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/65436
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.