Skip to main content

A parallel statistical cooling algorithm

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 210))

Abstract

Statistical Cooling is a new optimization technique based on Monte-Carlo iterative improvement. Here we propose a parallel formulation of the statistical cooling algorithm based on the requirement that quasi-equilibrium is preserved throughout the optimization process. It is shown that the parallel algorithm can be executed in polynomial time. Performance of the algorithm is discussed by means of an implementation on an experimental multi-processor architecture. It is concluded that substantial reductions of computation time can be achieved by the parallel algorithm in comparison with the sequential algorithm.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E.H.L. and P.J.M. van Laarhoven, "Simulated Annealing: State of the Art and Current Trends", to be published.

    Google Scholar 

  2. Aarts, E.H.L. and P.J.M. van Laarhoven, "Statistical Cooling: A General Approach to Combinatorial Optimization Problems", Philips Journ. Res. 40(1985)193.

    Google Scholar 

  3. Aarts, E.H.L. and P.J.M. van Laarhoven, "Quantitative Analysis of the Statistical Cooling Algorithm", Philips Journ. Res., to be published.

    Google Scholar 

  4. Ackley, D.H., G.E. Hinton and T.J. Sejnowski, "A Learning Algorithm for Boltzmann Machines", Cognitive Science 9(1985)147.

    Article  Google Scholar 

  5. R.M. Garey and J.D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", W.H. Freeman and Co., San Francisco, 1979.

    Google Scholar 

  6. Geman S. and D. Geman, "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images", IEEE Trans. Pattern Anal. Mach. Intel. 6(1984)721.

    Google Scholar 

  7. Kirkpatrick, S., C.D. Gelatt Jr. and M.P. Vecchi, "Optimization by Simulated Annealing", Science 220(1983)671.

    Google Scholar 

  8. Lin, S. and B.W. Kernighan, "An Effective Heuristic Algorithm for the Traveling Salesman Problem", Operations Res. 21(1973)498.

    Google Scholar 

  9. Metropolis, M. et al. "Equation of State Calculations by Fast Computing Machines", J. Chem. Phys. 21(1953)1087.

    Google Scholar 

  10. Romeo, F. and A.L. Sangiovanni-Vincentelli, "Probabilistic Hill Climbing Algorithms: Properties and Applications", University of Berkeley, Mem. No. UCB/ERL M 84/34, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

B. Monien G. Vidal-Naquet

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aarts, E.H.L., de Bont, F.M.J., Habers, J.H.A., van Laarhoven, P.J.M. (1985). A parallel statistical cooling algorithm. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-16078-7_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16078-6

  • Online ISBN: 978-3-540-39758-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics