Parallel simulated annealing for the n-queen problem

A parallel simulated annealing method, IIP, is applied to the n-queen problem. By this method, identical multiple copies of the single process algorithm are independently run in parallel. This technique gives superlinear speedup, in some cases on the order of 50 using only 8 processors. Convergence...

Full description

Saved in:
Bibliographic Details
Main Authors: Shonkwiler, R., Ghannadian, F., Alford, C.O.
Format: Conference Proceeding
Language:English
Subjects:
Analytical models
Cooling
Energy states
Mathematics
Optimization methods
Sampling methods
Simulated annealing
Stochastic processes
Temperature
Thermodynamics
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A parallel simulated annealing method, IIP, is applied to the n-queen problem. By this method, identical multiple copies of the single process algorithm are independently run in parallel. This technique gives superlinear speedup, in some cases on the order of 50 using only 8 processors. Convergence to the solution exceeds 99.96% for as few as 4 processors. In addition, simulated annealing was compared with a constant temperature version of itself since the resulting homogeneous Markov chain is amendable to Perron-Frobenius analysis. The two algorithms perform similarly.< >
DOI:10.1109/IPPS.1993.262797