On the convergence of stationary distributions in simulated annealing algorithms

DOI10.1016/0020-0190(88)90024-5zbMath0638.65054OpenAlexW1998834658MaRDI QIDQ1099589

Ulrich Faigle, Rainer Schrader

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90024-5

zbMATH Keywords

convergencecombinatorial optimizationMarkov processesMarkov chainSimulated annealingequilibrium distributionstationary distributionsdiscrete optimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Probabilistic methods, stochastic differential equations (65C99)

Related Items

A theoretical framework for simulated annealing, Tabu search techniques. A tutorial and an application to neural networks, Metaheuristics: A bibliography, Simulated annealing: A tool for operational research, Optimal design of LAN-WAN internetworks: An approach using simulated annealing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Probabilistic exchange algorithms and Euclidean traveling salesman problems
• Non-negative matrices and Markov chains. 2nd ed
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence of an annealing algorithm
• Using simulated annealing to solve routing and location problems
• Simulated annealing methods with general acceptance probabilities
• Cooling Schedules for Optimal Annealing
• Equation of State Calculations by Fast Computing Machines