Best-so-far vs. where-you-are: Implications for optimal finite-time annealing

DOI10.1016/0167-6911(94)90028-0zbMath0791.90048OpenAlexW1964440694MaRDI QIDQ1319482

Kenneth D. Boese, Andrew B. Kahng

Publication date: 19 April 1994

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

Full work available at URL: https://doi.org/10.1016/0167-6911(94)90028-0

zbMATH Keywords

simulated annealingtraveling salesmangraph bisectionhill-climbingheuristic global optimizationmonotone cooling schedules

Mathematics Subject Classification ID

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

Related Items

A new adaptive multi-start technique for combinatorial global optimizations, Computational approaches to a combinatorial optimization problem arising from text classification, Metaheuristics: A bibliography, Hysteretic optimization for the traveling salesman problem, Optimal parameters for search using a barrier tree Markov model, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, A theoretical study on the behavior of simulated annealing leading to a new cooling schedule, A two-stage simulated annealing procedure for block layout problems

Uses Software

• TimberWolf

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Efficient simulated annealing on fractal energy landscapes
• Simulated annealing, random search, MultiStart or SAD?
• Simulated annealing - to cool or not
• Analysis of finite length annealing schedules
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing