Problem Independent Distributed Simulated Annealing and its Applications

Simulated annealing has proven to be a good technique for solving hard combinatorial optimization problems. Some attempts at speeding up annealing algorithms have been based on shared memory multiprocessor systems. Also parallelizations for certain problems on distributed memory multiprocessor systems are known.

[1]  Salvatore Orlando,et al.  Strategies for a Massively Parallel Implementation of Simulated Annealing , 1989, PARLE.

[2]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[3]  Alberto L. Sangiovanni-Vincentelli,et al.  A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  B. Monien,et al.  An optimized reconfigurable architecture for transputer networks , 1992, Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences.

[5]  R. H. J. M. Otten,et al.  The Annealing Algorithm , 1989 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Russell Holland Seacat.  Parallelization of the simulated annealing algorithm , 1994 .

[8]  D. Balmer.  Theoretical and Computational Aspects of Simulated Annealing , 1991 .

[9]  M.D. Durand.  Parallel simulated annealing: accuracy vs. speed in placement , 1989, IEEE Design & Test of Computers.

[10]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[11]  James R. A. Allwright,et al.  A distributed implementation of simulated annealing for the travelling salesman problem , 1989, Parallel Comput..

[12]  Emile H. L. Aarts,et al.  Parallel implementations of the statistical cooling algorithm , 1986, Integr..

[13]  F. Darema,et al.  Parallel Algorithms for Chip Placement by Simulated Annealing , 1987, IBM J. Res. Dev..

[14]  Insup Lee,et al.  Synthesizing Minimum Total Expansion Topologies for Reconfigurable Interconnection Networks , 1989, J. Parallel Distributed Comput..

[15]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[16]  Ora E. Percus,et al.  Random Number Generators for MIMD Parallel Processors , 1989, J. Parallel Distributed Comput..

[17]  P.J.M. van Laarhoven,et al.  Theoretical and Computational Aspects of Simulated Annealing. , 1990 .

[18]  Prithviraj Banerjee,et al.  Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..