The Stochastics of Threshold Accepting: Analysis of an Application to the Uniform Design Problem
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.
|Date of creation:||2005|
|Contact details of provider:|| Web page: http://www.uni-erfurt.de/staatswissenschaften/|
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 211-223, September.
- Winker, Peter & Fang, Kai-Tai, 1995. "Application of threshold accepting to the evaluation of the discrepancy of a set of points," Discussion Papers, Series II 248, University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy".