Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
DOI10.1016/0167-6911(94)90028-0zbMATH Open0791.90048OpenAlexW1964440694MaRDI QIDQ1319482FDOQ1319482
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
Recommendations
simulated annealingtraveling salesmangraph bisectionhill-climbingheuristic global optimizationmonotone cooling schedules
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Optimization by simulated annealing
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Title not available (Why is that?)
- Analysis of finite length annealing schedules
- Convergence of an annealing algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cooling Schedules for Optimal Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Simulated annealing - to cool or not
- Efficient simulated annealing on fractal energy landscapes
- Simulated annealing, random search, MultiStart or SAD?
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
- Title not available (Why is that?)
- 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
Uses Software
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)