Experiments with Simulated Annealing

The performance of simulated annealing is compared to that of other Monte Carlo methods for optimization. Our experiments show that these other methods often perform better than simulated annealing.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  Shigeki Goto,et al.  Suboptimum solution of the back-board ordering with channel capacity constraint , 1977 .

[3]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[5]  Sartaj Sahni,et al.  The complexity of single row routing , 1984 .

[6]  Sartaj Sahni,et al.  Experiments with Simulated Annealing , 1985, DAC 1985.

[7]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[8]  Kenneth J. Supowit,et al.  Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..