1991
DOI: 10.1007/bf01447741
|View full text |Cite
|
Sign up to set email alerts
|

On the convergence of ?Threshold Accepting?

Abstract: 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".

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
31
0
3

Year Published

1992
1992
2009
2009

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 87 publications
(35 citation statements)
references
References 6 publications
1
31
0
3
Order By: Relevance
“…For all of these techniques it is usual to vary L k according to the schedule L k+1 = L k + α, though there is no reason why others cannot be used. For further details and applications, the reader is referred to the papers (Althofer and Koschnick, 1991;Sinclair, 1993).…”
Section: Threshold Methodsmentioning
confidence: 99%
“…For all of these techniques it is usual to vary L k according to the schedule L k+1 = L k + α, though there is no reason why others cannot be used. For further details and applications, the reader is referred to the papers (Althofer and Koschnick, 1991;Sinclair, 1993).…”
Section: Threshold Methodsmentioning
confidence: 99%
“…Before turning to an empirical analysis of D I (µ I , σ I ) in Section 3 for the application to the uniform design problem, a few general properties of this distribution can be discussed. For TA, Althöfer and Koschnik (1991) provide a convergence result. The theorem states that there exist suitable parameters for the TA implementation such that for any ε > 0 and δ > 0, there exists a number of iterations I such that…”
Section: Formal Frameworkmentioning
confidence: 99%
“…Tanto SA y TA son métodos de optimización cuya convergencia se demuestra bajo determinadas condiciones. En el caso del TA, Althofer y Koschnick [14] demostraron que a tiempo infinito converge al óptimo global. Desde el punto de vista práctico, las demostraciones de convergencia al óptimo global, no deben sobrevalorarse porque se cumplen para tiempos de cálculo no aplicables en la realidad.…”
Section: Aceptación Por Umbralesunclassified