Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Identifying clusters as low-lying minima - Efficiency of stochastic and genetic algorithms using inexpensive electronic structure levels
 
research article

Identifying clusters as low-lying minima - Efficiency of stochastic and genetic algorithms using inexpensive electronic structure levels

Avaltroni, Fabrice  
•
Corminboeuf, Clemence  
2011
Journal of Computational Chemistry

Molecular candidates possessing unconventional chemical bonding paradigms (e.g., boron wheels, molecular stars, and multicenter bonding) have attracted a great deal of attention by the computational community. The viability of such systems is necessarily assessed through the identification of the lowest lying energy forms of a given chemical composition on the potential energy surface (PES). Although dozens of search algorithms have been developed, only a few are general and simple enough to become standard everyday procedures for this purpose. The simple random search and genetic algorithm (GA) are among these: but how do these approaches perform on typical isomeric searches? The performance of three specific variants for the ab initio exploration of the PES of prototype planar tetracoordinated and hypercoordinated carbon-containing systems C2Al4 and CB62- are compared. The advantages of preoptimizing with a low-cost semiempirical method (e.g., PM6) together with the most cost-efficient GA-based variant are discussed, and the trends verified by the isomer search of the larger Si5Li7+ clusters. (c) 2011 Wiley Periodicals, Inc. J Comput Chem, 2011

  • Details
  • Metrics
Type
research article
DOI
10.1002/jcc.22882
Web of Science ID

WOS:000299415400004

Author(s)
Avaltroni, Fabrice  
Corminboeuf, Clemence  
Date Issued

2011

Publisher

Wiley-Blackwell

Published in
Journal of Computational Chemistry
Volume

33

Issue

5

Start page

502

End page

508

Subjects

Genetic Algorithm

•

electronic structures

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LCMD  
Available on Infoscience
November 28, 2011
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/72880
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés