Abstract
In this paper, we propose a new kind of simulated annealing algorithm calledtwo-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.
Similar content being viewed by others
References
S.G. Akl,The Design and Analysis of Parallel Algorithms, Prentice-Hall International, Inc., 1989.
C.G.E. Boender and A.H.G. Rinooy Kan, Bayesian Stopping Rules for Multistart Global Optimization Methods,Mathematical Programming, Vol. 37(1987), pp. 59–80.
R.J. Brouwer, P. Banerjee, A Parallel Simulated Annealing Algorithm for Channel Routing on a Hypercube Multiprocessor,Proceedings of 1988 IEEE International Conference on Computer Design, pp. 4–7.
J.P. Brunet, A. Edehnan, J.P. Mesirov, An Optimal Hypercube Direct N-body Solver on the Connection Machine,Proceedings of Supercomputing'90, pp. 748–752, IEEE Computer Society Press 1990.
R.H. Byrd, E. Eskow, R.B. Schnabel, and S.L. Smith, Parallel Global Optimization: Numerical Methods, Dynamic Scheduling Methods, and Application to Molecular Configuration,Technical Report CU-CS-553-91, University of Colorado at Boulder, Department of Computer Science, Boulder, CO., October 1991.
R.H. Byrd, E. Eskow, R.B. Schnabel, Global Optimization Methods for Molecular Configuration Problems, Presented at theFourth SIAM Conference on Optimization, May 11–13, 1992, Chicago, IL.
R.D. Chamberlain, M.N. Edehnan, M.A. Franklin, E.E. Witte, Simulated Annealing on a Multiprocessor,Proceedings of 1988 IEEE International Conference on Computer Design, pp. 540–544.
J.H. Conway and N.J.A. Sloane,Sphere Packings, Lattices and Groups, Springer-Verlag, 1988.
A. Corana, M. Marchesi, C. Martini, and S. Ridella, Minimizing Multimodal Functions of Continuous Variables with the “Simulated Annealing” Algorithm,ACM Transactions on Mathematical Software, Vol. 13(1987), pp. 262–280.
F. Darema, S. Kirkpatrick, V.A. Norton, Parallel Techniques for Chip Placement by Simulated Annealing on Shared Memory Systems,Proceedings of 1987 IEEE International Conference on Computer Design, pp. 87–90.
J. Farges, M.F. De Feraudy, B. Raoult and G. Torchet, Cluster Models Made of Double Icosahedron Units,Surface Science, Vol. 156(1985), pp. 370–378.
I.Z. Fisher,Statistical Theory of Liquids, University of Chicago Press, 1964.
D.G. Garrett,K.D. Kastella, D.M. Ferguson, New Results on Protein Folding from Simulated Annealing, submitted toJournal of the American Chemistry Society, 1992.
M.R. Hoare, Structure and Dynamics of Simple Microclusters,Advances in Chemical Physics, Vol. 40(1979), pp. 49–135.
J. Danna Honeycutt and Hans C. Andersen, Molecular Dynamics Study of Melting and Freezing of Small Lennard-Jones Clusters,Journal of Physical Chemistry, Vol. 91(1987), pp. 4950–4963.
L. Ingber, Very Fast Simulated Reannealing: A Comparison,Mathematical and Computer Modeling, Vol. 12(1989), pp. 967–973.
L. Ingber, Genetic Algorithms and Very Fast Simulated Reannealing: A Comparison, To appear inMathematical and Computer Modeling, 1992.
R.S. Judson, M.E. Colvin, J.C. Meza, A. Huffer, and D. Gutierrez, Do Intelligent Configuration Search Techniques Outperform Random Search for Large Molecules?,Sandia Report SAND91-8740, Sandia National Laboratories, Center for Computational Engineering, Livermore, CA., December 1991.
S. Kirkpatrick, C.D. Gelatt, Jr., M.P. Vecchi, Optimization by Simulated Annealing,Science, Vol. 220(1983), pp. 671–680.
S. Kirkpatrick, Optimization by Simulated Annealing: Quantitative Studies,Journal of Statistical Physics, Vol. 34(1984), pp. 975–986.
D.C. Liu and J. Nocedal, On the Limited Memory BFGS Method for Large Scale Optimization,Mathematical Programming, Vol. 45 (1989), pp. 503–528.
R.S. Maier, J.B. Rosen, G.L. Xue, A Discrete-Continuous Algorithm for Molecular Energy Minimization, inProceedings of Supercomputing'92, Minneapolis, November 16–20, 1992, pp. 778–786.
N. Metropolis, A. Rosenhluth, A. Teller, E. Teller, Equation of Several State Calculations by Fast Computing Machines,Journal of Chemical Physics, Vol. 21(1953), pp. 1087–1892.
S. Nahar, S. Sahni, E. Shragowitz, Experiments with Simulated Annealing,22nd Design Automation Conference, 1985, pp. 748–752.
J.A. Northby, Structure and Binding of Lennard-Jones Clusters: 13 ≤n ≤ 147,Journal of Chemical Physics, Vol. 87(1987), pp. 6166–6178.
C.P. RaviKumar, L.M. Patnaik, Parallel Placement by Simulated Annealing,Proceedings of 1987 IEEE International Conference on Computer Design, pp. 91–94.
D.R. Ripoll, S.J. Thomas, A Parallel Monte Carlo Search Algorithm for the Conformational Analysis of Proteins,Proceedings ACM/IEEE Supercomputing'90, pp. 94–102.
T. Schlick and M. Overton, A Powerful Truncated Newton Method for Potential Energy Minimization,Journal of Computational Chemistry, Vol. 8(1987), pp. 1025–1039.
David Shalloway, Packet Annealing: A Deterministic Method for Global Minimization, Application to Molecular Conformation,Recent Advances in Global Optimization, C. Floudas and P. Pardalos, eds. Princeton University Press: Princeton, NJ, 1991.
Thinking Machines Corporation,CMMD Reference Manual, Version 1.1, 1992.
Thinking Machines Corporation,CMMD User's Guide, Version 1.1, 1992.
D.G. Vlachos, L.D. Schmidt, and R. Aris, Structures of Small Metal Clusters: Phase Transitions and Isomerization,Army High Performance Computing Research Center Preprint 91-69, University of Minnesota, Minneapolis, 1991.
D.G. Vlachos, L.D. Schmidt, and R. Aris, Structures of Small Metal Clusters: Low Temperature Behavior,Army High Performance Computing Research Center Preprint 91-70, University of Minnesota, Minneapolis, 1991.
L.T. Wille, Minimum-Energy Configurations of Atomic Clusters: New Results Obtained by Simulated Annealing,Chemical Physics Letters, Vol. 133(1987), pp. 405–410.
G.L. Xue, R.S. Maier, J.B. Rosen, Minimizing the Lennard-Jones Potential Function on a Massively Parallel Computer, in Proceedings of1992 ACM International Conference on Supercomputing, pp. 409–416, ACM Press, 1992.
Author information
Authors and Affiliations
Additional information
Also a researcher at the Army High Performance Computing Research Center, University of Minnesota, Minneapolis, MN 55415
Rights and permissions
About this article
Cite this article
Xue, G. Molecular conformation on the CM-5 by parallel two-level simulated annealing. J Glob Optim 4, 187–208 (1994). https://doi.org/10.1007/BF01096722
Issue Date:
DOI: https://doi.org/10.1007/BF01096722