𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Global Optimization of Lennard-Jones Clusters by a Parallel Fast Annealing Evolutionary Algorithm

✍ Scribed by Cai, W.; Jiang, H.; Shao, X.

Book ID
121461068
Publisher
American Chemical Society
Year
2002
Tongue
English
Weight
170 KB
Volume
42
Category
Article
ISSN
0095-2338

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast annealing evolutionary algorithm
A fast annealing evolutionary algorithm for global optimization
✍ Wensheng Cai; Xueguang Shao πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract By combining the aspect of population in genetic algorithms (GAs) and the simulated annealing algorithm (SAA), a novel algorithm, called fast annealing evolutionary algorithm (FAEA), is proposed. The algorithm is similar to the annealing evolutionary algorithm (AEA), and a very fast ann

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