## 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
Global geometry optimization of clusters using a growth strategy optimized by a genetic algorithm
โ Scribed by Bernd Hartke
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 595 KB
- Volume
- 240
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
โฆ Synopsis
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 clusters. The strengths and possible limitations of the method are demonstrated for Si,, using an empirical potential.
๐ SIMILAR VOLUMES
For many optimum design problems, the objectiยฎe function is the result of a complex numerical code and may not be differentiable and explicit. The first aim is to propose a way of solยฎing such complexity on an example problem. A noยฎel and global strategy inยฎolยฎing artificial neural networks and a ge
A Genetic Algorithm for Geometry Optimizations (GALGO) program has been developed to study the efficiency of this method of finding global minimum structures. Using a semiempirical tight-binding potential, the behavior of different genetic algorithm (GA) operators has been tested for the linear chai
A modified genetic algorithm approach has been applied to ลฝ . atomic Ar clusters and molecular water clusters up to H O . Several genetic 2 13 operators are discussed which are suitable for real-valued space-fixed atomic coordinates and Euler angles. The performance of these operators has been syst