The stochastics of threshold accepting: analysis of an application to the uniform design problem

Peter Winker

A chapter in Compstat 2006 - Proceedings in Computational Statistics, 2006, pp 495-503 from Springer

Abstract: Abstract Threshold Accepting is a powerful optimization heuristic from the class of stochastic local search algorithms. It has been applied successfully to several problems in statistics and econometrics, including the uniform design problem. Using the latter application as an example, the stochastic properties of a TA implementation are analyzed. We provide a formal framework for the analysis of optimization heuristics, which can be used to estimate lower bounds and to derive convergence results. It is also helpful for tuning real applications. Empirical results are presented for the uniform design problem. In particular, the rate of convergence of the algorithm is estimated to be of the order of one over square root of the number of iterations.

Keywords: Threshold Accepting; Uniform Design; convergence (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Working Paper: The Stochastics of Threshold Accepting: Analysis of an Application to the Uniform Design Problem (2005)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7908-1709-6_40

Ordering information: This item can be ordered from
http://www.springer.com/9783790817096

DOI: 10.1007/978-3-7908-1709-6_40

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().