Conquering the hard cases of Lennard-Jones clusters with simple recipes

Dittner, Mark and Hartke, Bernd (2017) Conquering the hard cases of Lennard-Jones clusters with simple recipes Computational and Theoretical Chemistry, 1107 . pp. 7-13. DOI 10.1016/j.comptc.2016.09.032.

Full text not available from this repository.

Supplementary data:


Lennard-Jones clusters are the best-known benchmark for global cluster structure optimization. For a few cluster sizes, the landscape is deceptive, featuring several funnels, with the global minimum not being in the widest one. More than a decade ago, several non-deterministic global search algorithms were presented that could solve these cases, mostly using additional tools to ensure structural diversity. Recently, however, many publications have advertised new search algorithms, claiming efficiency but being unable to solve these harder benchmark cases. Here, we demonstrate that evolutionary algorithms can solve these hard cases efficiently, if enhanced with one of several very different diversity measures (niching) which were set up in an ad-hoc way, without extensive deliberation, testing or tuning. Hence, these hard benchmark cases should definitely be considered solvable. Additionally, these niching concepts offer insights into the different Lennard-Jones structural types, and into the way niching works in evolutionary algorithms.

Document Type: Article
Research affiliation: Kiel University
Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Refereed: Yes
DOI etc.: 10.1016/j.comptc.2016.09.032
ISSN: 2210271X
Date Deposited: 18 Dec 2017 13:09
Last Modified: 18 Dec 2017 13:09

Actions (login required)

View Item View Item