✦ LIBER ✦

Structural optimization of Lennard-Jones clusters by a genetic algorithm

✍ Scribed by D.M. Daven; N. Tit; J.R. Morris; K.M. Ho

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 413 KB
Volume: 256
Category: Article
ISSN: 0009-2614
DOI: 10.1016/0009-2614(96)00406-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic lattice searching method for f

A dynamic lattice searching method for fast optimization of Lennard–Jones clusters

✍ Xueguang Shao; Longjiu Cheng; Wensheng Cai 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract A highly efficient unbiased global optimization method called dynamic lattice searching (DLS) was proposed. The method starts with a randomly generated local minimum, and finds better solution by a circulation of construction and searching of the dynamic lattice (DL) until the better so

Global geometry optimization of clusters

Global geometry optimization of clusters using a growth strategy optimized by a genetic algorithm

✍ Bernd Hartke 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 595 KB

A new strategy for global geometry optimization of clusters is presented. Important features are a restriction of search space to favorable nearest-neighbor distance ranges, a suitable cluster growth representation with diminished correlations, and easy transferability of the results to larger clust

A dynamic lattice searching method with

A dynamic lattice searching method with constructed core for optimization of large lennard-jones clusters

✍ Xiaoli Yang; Wensheng Cai; Xueguang Shao 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB 👁 1 views

## Abstract A variation of the previous dynamic lattice searching (DLS) method, named as DLS with constructed core (DLSc), was proposed for structural optimization of Lennard‐Jones (LJ) clusters. In the new method, the starting random structure is generated with an icosahedron or a decahedron as a

Strategies for increasing the efficiency

Strategies for increasing the efficiency of a genetic algorithm for the structural optimization of nanoalloy clusters

✍ Lesley D. Lloyd; Roy L. Johnston; Said Salhi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract An improved genetic algorithm (GA) is described that has been developed to increase the efficiency of finding the global minimum energy isomers for nanoalloy clusters. The GA is optimized for the example Pt~12~Pd~12~, with specific investigation of: the effect of biasing the initial pop

A dynamic lattice searching method with

A dynamic lattice searching method with interior operation for unbiased optimization of large Lennard-Jones clusters

✍ Xueguang Shao; Xiaoli Yang; Wensheng Cai 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract For improving the efficiency of dynamic lattice searching (DLS) method for unbiased optimization of large Lennard‐Jones (LJ) clusters, a variant of the interior operation (IO) proposed by Takeuchi was combined with DLS. The method is named as DLS‐IO. In the method, the IO moves outer at

Geometry optimizations of benzene cluste

Geometry optimizations of benzene clusters using a modified genetic algorithm

✍ Cai Wen-Sheng; Yu Fang; Shao Xue-Guang; Pan Zhong-Xiao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 399 KB 👁 1 views

## Abstract A modified genetic algorithm with real‐number coding, non‐uniform mutation and arithmetical crossover operators was described in this paper. A local minimization was used to improve the final solution obtained by the genetic algorithm. Using the exp‐6–1 interatomic energy function, the