Issue No. 10 - October (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.473510
<p><it>Abstract</it>—Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for realistic problem size, however, has been limited by the long execution time due to its sequential nature. This report presents a practical approach to <it>synchronous</it> simulated annealing for massively parallel distributed-memory multiprocessors. We use an <it>n</it>-ary speculative tree to execute <it>n</it> different iterations in parallel on <it>n</it> processors, called <it>Generalized Speculative Computation</it> (GSC). Execution results of the 100- to 500-city Traveling Salesman Problems on the AP1000 massively parallel multiprocessor demonstrate that the GSC approach can be an effective method for parallel simulated annealing as it gave over 20-fold speedup on 100 processors.</p>
Parallel simulated annealing, combinatorial optimization, synchronous simulated annealing, speculative computation, Traveling Salesman Problem, simulated annealing.
A. Sohn, "Parallel N-ary Speculative Computation of Simulated Annealing," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 997-1005, 1995.