On the convergence of “Threshold Accepting”
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Simulated Annealing (SA) has become a very popular tool in combinatorial optimization since its introduction in 1982. Recently Dueck and Scheuer proposed another simple modification of local search which they called “Threshold Accepting” (TA). In this paper some convergence results for TA are presented. The proofs are not constructive and make use of the fact that in a certain sense “SA belongs to the convex hull of TA”.
- G. Dueck and T. Scheuer, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics 90 (1990), 161–175.
- P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, New York, 1974.
- S. B. Gelfand and S. K. Mitter, Analysis of simulated annealing for optimization, Technical Report LIDS-P-1495, August 1985.
- S. B. Gelfand and S. K. Mitter, Analysis of simulated annealing for optimization, Proc. 24th Conf. on Decision and Control, Ft Lauderdale, December 1985, pp. 779–786.
- M. Grötschel, Polyedrische Kombinatorik und Schnittebenenverfahren, Preprint No. 38, Universität Augsburg, 1984.
- B. Hajek and G. Sasaki, Simulated annealing—to cool or not, Systems & Control Letters 12 (1989), 443–447.
- S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, Optimization by simulated annealing, IBM Research Report RC 9355, 1982.
- S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983), 671–680.
- P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications, Reidel, Dordrecht, 1987.
- On the convergence of “Threshold Accepting”
Applied Mathematics and Optimization
Volume 24, Issue 1 , pp 183-195
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links