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 reco
β¦ LIBER β¦
Optimization by simulated annealing: Quantitative studies
β Scribed by Scott Kirkpatrick
- Book ID
- 105035346
- Publisher
- Springer
- Year
- 1984
- Tongue
- English
- Weight
- 620 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0022-4715
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Geometry optimization by simulated annea
β
Robert A. Donnelly
π
Article
π
1987
π
Elsevier Science
π
English
β 394 KB
Simulation optimization using simulated
β
Jorge Haddock; John Mittenthal
π
Article
π
1992
π
Elsevier Science
π
English
β 612 KB
Robust optimization with simulated annea
β
Dimitris Bertsimas; Omid Nohadani
π
Article
π
2009
π
Springer US
π
English
β 537 KB
Multiobjective Optimization of Concrete
β
Ignacio Paya; VΓctor Yepes; Fernando GonzΓ‘lez-Vidosa; Antonio Hospitaler
π
Article
π
2008
π
John Wiley and Sons
π
English
β 235 KB
Continuous optimization by a variant of
β
P. Patrick Wang; Der-San Chen
π
Article
π
1996
π
Springer US
π
English
β 549 KB
Parallel simulated annealing for structu
β
J.P.B. Leite; B.H.V. Topping
π
Article
π
1999
π
Elsevier Science
π
English
β 391 KB
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