Simulated annealing - to cool or not

DOI10.1016/0167-6911(89)90081-9zbMath0685.93075OpenAlexW2037719911MaRDI QIDQ1262289

Bruce Hajek, Galen Sasaki

Publication date: 1989

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(89)90081-9

zbMATH Keywords

simulated annealingneighbor selection matricesthreshold random search

Mathematics Subject Classification ID

Related Items (10)

Smoothers for Discontinuous Signals ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Metaheuristics: A bibliography ⋮ Revisiting simulated annealing: a component-based analysis ⋮ On the convergence of ``threshold accepting ⋮ Risk-pooling strategy, lead time, delivery reliability and inventory control decisions in a stochastic multi-objective supply chain network design ⋮ Approximate solution of a resource-constrained scheduling problem ⋮ A new genetic algorithm ⋮ Improved lower bound on the Shannon capacity of \(C_7\) ⋮ Best-so-far vs. where-you-are: Implications for optimal finite-time annealing

Cites Work

• Unnamed Item
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Simulated annealing, random search, MultiStart or SAD?
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• The time complexity of maximum matching by simulated annealing

This page was built for publication: Simulated annealing - to cool or not