Geometry optimization by simulated annealing
โ Scribed by Robert A. Donnelly
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 394 KB
- Volume
- 136
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
โฆ Synopsis
Simulated annealing is shown to be effective in locating good local minima in a simple geometry-optimization problem. Extensions to problems involving small clusters of molecules is straightforward, as is its use in geometry optimization within a single molecule. The simplicity of the technique recommends its closer investigation in molecular structure applications.
๐ SIMILAR VOLUMES
The simulated annealing (SA) algorithm has proven to be a good technique for solving dicult combinatorial optimization problems. In engineering optimization the SA has emerged as an alternative tool to solve problems which are dicult to solve by conventional mathematical programming techniques. The
We propose a stochastic optimization technique based on a ลฝ . generalized simulated annealing GSA method for mapping minima points of molecular conformational energy surfaces. The energy maps are obtained by ลฝ . coupling a classical molecular force field THOR package with a GSA procedure. ลฝ . Unlik
The viability of what has been known as the Metropolis simulated-annealing method (MSAM) in the optimization of molecular geometry is tested. The ability of MSAM to seek out the global energy minimum on a potential energy hypersurface with multiple minima is demonstrated m model calculations.