On the convergence of ``threshold accepting

DOI10.1007/BF01447741zbMath0816.90113OpenAlexW1968648452WikidataQ56657001 ScholiaQ56657001MaRDI QIDQ1179163

Klaus-Uwe Koschnick, Ingo Althöfer

Publication date: 26 June 1992

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01447741

zbMATH Keywords

local searchthreshold acceptingconvergence resultsthreshold sequence

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (24)

The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models ⋮ Wrap-around \(L_2\)-discrepancy of random sampling Latin hypercube and uniform designs ⋮ Choice of optimal second stage designs in two-stage experiments ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Improving simulated annealing through derandomization ⋮ Metaheuristics: A bibliography ⋮ Further improvements in the calculation of censored quantile regressions ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Heuristic optimisation in financial modelling ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ The convergence of optimization based GARCH estimators: theory and application ⋮ The stochastics of threshold accepting: analysis of an application to the uniform design problem ⋮ Identification of multivariate AR-models by threshold accepting ⋮ A global optimization heuristic for estimating agent based models ⋮ The heuristic approach in finding initial values for minimum density power divergence estimators ⋮ Optimal aggregation of linear time series models ⋮ Mixed-level column augmented uniform designs ⋮ Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs ⋮ The noising methods: A generalization of some metaheuristics ⋮ Distributed optimisation of a portfolio's omega ⋮ Augmented uniform designs ⋮ Adaptive schedules for ensemble-based threshold accepting ⋮ Improving the computation of censored quantile regressions ⋮ On the convergence of generalized hill climbing algorithms

Cites Work

• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Simulated annealing - to cool or not
• Unnamed Item
• Unnamed Item

This page was built for publication: On the convergence of ``threshold accepting