Optimization by simulated annealing: Quantitative studies
- Scott Kirkpatrick
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi,Science 220:671–680 (1983).
- M. P. Vecchi and S. Kirkpartrick, to appear inIEEE Trans. Circuits Systems.
- N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller,J. Chem. Phys. 21:1087–1092 (1953).
- T. N. Bui, private communication (MIT report).
- B. W. Kernighan and S. Lin,Bell Syst. Tech. J. 49:291–307 (1970).
- C. M. Fiduccia and R. M. Mattheyses, Proceedings of the 19th DA Conference, Las Vegas (1982), pp. 175–181.
- M. Burstein and M. K. Goldberg, Proc. ICCD, Port Chester (1983), pp. 122–125.
- S. Lin,Bell Syst. Tech. J. 44:2245 (1965).
- S. Lin and B. W. Kernighan,Oper. Res. 21:498 (1973).
- Optimization by simulated annealing: Quantitative studies
Journal of Statistical Physics
Volume 34, Issue 5-6 , pp 975-986
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers-Plenum Publishers
- Additional Links
- Spin glasses
- graph partitioning
- Industry Sectors
- Author Affiliations
- 1. IBM Research, 10598, Yorktown Heights, New York