ISSN 0253-2778

CN 34-1054/N

Open AccessOpen Access JUSTC

Comparative study of basin-hopping and the minima-hopping global optimization methods: A case study on Lennard-Jones clusters

Cite this:
https://doi.org/10.3969/j.issn.0253-2778.2015.05.005
  • Received Date: 24 March 2015
  • Rev Recd Date: 12 May 2015
  • Publish Date: 31 May 2015
  • In order to find a better algorithm for global optimization of Lennard-Jones cluster, two algorithms, basin-hopping and minima-hopping, were used to optimize the structures of 13 particles, 38 particles, and 60 particles Lennard-Jones clusters. Both algorithms find global minima, while the minima-hopping method yields a faster search speed which is at least one order faster than the basin-hopping method.
    In order to find a better algorithm for global optimization of Lennard-Jones cluster, two algorithms, basin-hopping and minima-hopping, were used to optimize the structures of 13 particles, 38 particles, and 60 particles Lennard-Jones clusters. Both algorithms find global minima, while the minima-hopping method yields a faster search speed which is at least one order faster than the basin-hopping method.
  • loading
  • 加载中

Catalog

    Article Metrics

    Article views (357) PDF downloads(170)
    Proportional views

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return