The Stochastics of Threshold Accepting: Analysis of an Application to the Uniform Design Problem

Peter Winker

No 2005,003E, Discussion Papers from University of Erfurt, Faculty of Economics, Law and Social Sciences

Abstract: Threshold Accepting (TA) is a powerful optimization heuristic from the class of stochastic local search algorithms. It has been applied successfully to different optimization problems in statistics and econometrics, including the uniform design problem. Using the latter application as example, the stochastic properties of a TA implementation are analyzed. We provide a formal framework for the analysis of optimization heuristics like TA, which can be used to estimate lower bounds and to derive convergence results. It is also helpful for tuning real applications. Based on this framework, empirical results are presented for the uniform design problem. In particular, for two problem instances, the rate of convergence of the algorithm is estimated to be of the order of a power of -0.3 to -0.7 of the number of iterations.

Keywords: Heuristic optimization; Threshold Accepting; Stochastic analysis of heuristics (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/23940/1/2005-003E.pdf (application/pdf)

Related works:
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:zbw:erfdps:2005003e

Access Statistics for this paper

More papers in Discussion Papers from University of Erfurt, Faculty of Economics, Law and Social Sciences Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().