Global optimization of chemical cluster structures: Methods, applications, and challenges

Research output: Contribution to journalReview articlepeer-review

51 Scopus citations

Abstract

Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state-of-the-art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.

Original languageEnglish
Article numbere26553
JournalInternational Journal of Quantum Chemistry
Volume121
Issue number7
DOIs
StatePublished - Apr 5 2021
Externally publishedYes

Funding

Office of Science, Grant/Award Number: DE-AC05-76RL01830

FundersFunder number
Office of ScienceDE-AC05-76RL01830

    Keywords

    • artificial bee colony
    • basin hopping
    • chemical clusters
    • genetic algorithm
    • global optimization
    • potential energy surface

    Fingerprint

    Dive into the research topics of 'Global optimization of chemical cluster structures: Methods, applications, and challenges'. Together they form a unique fingerprint.

    Cite this