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

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.