Applied Mathematics and Optimization

, Volume 24, Issue 1, pp 183–195

On the convergence of “Threshold Accepting”

  • Ingo Althöfer
  • Klaus-Uwe Koschnick
Article

DOI: 10.1007/BF01447741

Cite this article as:
Althöfer, I. & Koschnick, KU. Appl Math Optim (1991) 24: 183. doi:10.1007/BF01447741

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

Copyright information

© Springer-Verlag New York Inc. 1991

Authors and Affiliations

  • Ingo Althöfer
    • 1
  • Klaus-Uwe Koschnick
    • 1
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeld 1Germany