Abstract
In this paper, we propose a new kind of simulated annealing algorithm called two-level simulated annealing for solving certain class of hard combinatorial optimization problems. This two-level simulated annealing algorithm is less likely to get stuck at a non-global minimizer than conventional simulated annealing algorithms. We also propose a parallel version of our two-level simulated annealing algorithm and discuss its efficiency. This new technique is then applied to the Molecular Conformation problem in 3 dimensional Euclidean space. Extensive computational results on Thinking Machines CM-5 are presented. With the full Lennard-Jones potential function, we were able to get satisfactory results for problems for cluster sizes as large as 100,000. A peak rate of over 0.8 giga flop per second in 64-bit operations was sustained on a partition with 512 processing elements. To the best of our knowledge, ground states of Lennard-Jones clusters of size as large as these have never been reported before.
Original language | English (US) |
---|---|
Pages (from-to) | 187-208 |
Number of pages | 22 |
Journal | Journal of Global Optimization |
Volume | 4 |
Issue number | 2 |
DOIs | |
State | Published - Mar 1994 |
Externally published | Yes |
Keywords
- Molecular conformation
- global optimization
- parallel algorithms
- simulated annealing
ASJC Scopus subject areas
- Control and Optimization
- Applied Mathematics
- Business, Management and Accounting (miscellaneous)
- Computer Science Applications
- Management Science and Operations Research