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

DOI10.1016/0167-6911(94)90028-0MaRDI QIDQ1319482zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Simulated Annealing: Searching for an Optimal Temperature Schedule
• Computational Science and Its Applications – ICCSA 2004
• An analytically derived cooling schedule for simulated annealing
• Simulated annealing with an optimal fixed temperature
• Simulated annealing - to cool or not

Cites work

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Analysis of finite length annealing schedules
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• Efficient simulated annealing on fractal energy landscapes
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by simulated annealing
• Simulated annealing - to cool or not
• Simulated annealing, random search, MultiStart or SAD?
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(15)

• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Hysteretic optimization for the traveling salesman problem
• Computational Science and Its Applications – ICCSA 2004
• Optimal parameters for search using a barrier tree Markov model
• An information guided framework for simulated annealing
• Computational approaches to a combinatorial optimization problem arising from text classification
• Convergence of Simulated Annealing with Feedback Temperature Schedules
• Analysis of finite length annealing schedules
• A new adaptive multi-start technique for combinatorial global optimizations
• scientific article; zbMATH DE number 1728443 (Why is no real title available?)
• Optimal annealing schedules for a modified Tsallis statistics
• A two-stage simulated annealing procedure for block layout problems
• A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
• Metaheuristics: A bibliography
• The optimal simulated annealing schedule for a simple model

Describes a project that uses

Uses Software

• TimberWolf

This page was built for publication: Best-so-far vs. where-you-are: Implications for optimal finite-time annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319482)