Note on the Convergence of Simulated Annealing Algorithms

DOI10.1137/0329008zbMath0736.90061OpenAlexW2069860100MaRDI QIDQ3977037

Walter Kern, Ulrich Faigle

Publication date: 25 June 1992

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0329008

zbMATH Keywords

inductive proofstationary distributions of a simulated annealing algorithmweak reversibility condition

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Analyzing the performance of simultaneous generalized hill climbing algorithms ⋮ Metaheuristics: A bibliography ⋮ Four-bar Mechanism Synthesis for n Desired Path Points Using Simulated Annealing ⋮ Local search: is brute-force avoidable? ⋮ CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method ⋮ Improving the mechanical performances of a multilayered plate with the orientations of its layers of fibers ⋮ Some new results on simulated annealing applied to the job shop scheduling problem ⋮ Convergence of Simulated Annealing with Feedback Temperature Schedules ⋮ A new genetic algorithm ⋮ Quantum annealing learning search for solving QUBO problems

This page was built for publication: Note on the Convergence of Simulated Annealing Algorithms