Optimization by simulated annealing: Quantitative studies
- 5k Downloads
Simulated annealing is a stochastic optimization procedure which is widely applicable and has been found effective in several problems arising in computeraided circuit design. This paper derives the method in the context of traditional optimization heuristics and presents experimental studies of its computational efficiency when applied to graph partitioning and traveling salesman problems.
Key wordsSpin glasses optimization graph partitioning algorithms
Unable to display preview. Download preview PDF.
- 1.S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi,Science 220:671–680 (1983).Google Scholar
- 2.M. P. Vecchi and S. Kirkpartrick, to appear inIEEE Trans. Circuits Systems. Google Scholar
- 3.N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller,J. Chem. Phys. 21:1087–1092 (1953).Google Scholar
- 4.T. N. Bui, private communication (MIT report).Google Scholar
- 5.B. W. Kernighan and S. Lin,Bell Syst. Tech. J. 49:291–307 (1970).Google Scholar
- 6.C. M. Fiduccia and R. M. Mattheyses, Proceedings of the 19th DA Conference, Las Vegas (1982), pp. 175–181.Google Scholar
- 7.M. Burstein and M. K. Goldberg, Proc. ICCD, Port Chester (1983), pp. 122–125.Google Scholar
- 8.S. Lin,Bell Syst. Tech. J. 44:2245 (1965).Google Scholar
- 9.S. Lin and B. W. Kernighan,Oper. Res. 21:498 (1973).Google Scholar