, Volume 24, Issue 1, pp 183-195

On the convergence of “Threshold Accepting”

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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”.