Analysis of finite length annealing schedules
By constructing a master equation for the distribution of outcomes from simulated annealing, we are able to characterize this process exactly for arbitrary annealing schedules on extremely small problems. Two sorts of numerical experiments are reported, using this formalism. First, annealing schedules are found which minimize the cut cost of partitioning a highly symmetric weighted graph, using a fixed number of Monte Carlo search steps. The experiments yield some surprising results, which sharpen our understanding of the problems inherent in trying to optimize a stochastic search. For example, optimal annealing schedules are not monotone decreasing in temperature. Second, we construct configuration spaces of random energies and varying connectivity. These are used to compare different annealing schedules which are common in the literature. The experiments also provide an occasion to contrast annealing schedules derived from asymptotic, worst-case bounds on convergence to the global optimum with adaptive schedules which attempt to maintain the system close to equilibrium throughout the annealing process.
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- Convergence and finite-time behavior of simulated annealing
- A comparison of simulated annealing cooling strategies
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Efficient simulated annealing on fractal energy landscapes
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Optimised simulated annealing for Ising spin glasses
- Revisiting simulated annealing: a component-based analysis
- Simulated annealing algorithm for optimal capital growth
- Metaheuristics: A bibliography
- Optimal parameters for search using a barrier tree Markov model
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Local stationarity in small area estimation models
- A theoretical framework for simulated annealing
- A comparative study of non-traditional methods for vehicle crashworthiness and NVH optimization
- Finite-Time Behavior of Slowly Cooled Annealing Chains
- Efficient simulated annealing on fractal energy landscapes
This page was built for publication: Analysis of finite length annealing schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640465)
