Parallel simulated annealing by mixing of states
type: Item
instance of: scholarly article
title: Parallel simulated annealing by mixing of states
zbMATH Open document ID: 0920.65040
author: King-Wai Chu
author: Yuefan Deng
author: John Reinitz
published in: Journal of Computational Physics
publication date: 1999-09-19T00:00:00Z
review text: Simulated annealing (SA) is an effective method for the optimization of complex cost functions for which heuristic methods do not exist. The authors introduce a new class of algorithms for parallel SA that does not depend on the structure of the optimization problem. The authors show that one particular implementation of this algorithms is scalable for up to 100 processors at nearly 100\% parallel efficiency. The used strategy contains two major elements. The authors monitor and pool performance statistics obtained simultaneously on all processors and mix states at intervals to ensure a Boltzmann distribution of energies. Some tests are presented.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1272008
zbMATH Keywords: parallel computation
zbMATH Keywords: simulated annealing
zbMATH Keywords: algorithms
zbMATH Keywords: performance statistics
reviewed by: Hans Benker
describes a project that uses: ASA
MaRDI profile type: Publication
OpenAlex ID: W2028582548
cites work: Q3736831
cites work: Q4026129
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Very fast simulated re-annealing
cites work: Q4885610
cites work: Optimization by Simulated Annealing
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q3994364
DOI: 10.1006/JCPH.1998.6134
description: scientific article; zbMATH DE number 1272008