Simulated Simulated Annealing
- 1 February 1988
- journal article
- research article
- Published by Taylor & Francis in American Journal of Mathematical and Management Sciences
- Vol. 8 (3) , 389-407
- https://doi.org/10.1080/01966324.1988.10737246
Abstract
The principal shortcoming of simulated annealing (SA) is that it takes too much computer time. We present a few “swindling” ideas for speeding up SA by simulating its action on a problem. The increase in speed is attained at the cost of decreasing generality — the methods all require the use of problem-specific information. We illustrate the ideas with examples, and discuss our computational experience. We conclude with remarks on the usefulness of simulated annealing.Keywords
This publication has 6 references indexed in Scilit:
- Convergence and finite-time behavior of simulated annealingAdvances in Applied Probability, 1986
- Convergence of an annealing algorithmMathematical Programming, 1986
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Optimization by Simulated AnnealingScience, 1983
- Computer Simulation Swindles, with Applications to Estimates of Location and DispersionJournal of the Royal Statistical Society Series C: Applied Statistics, 1976
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953