An analytically derived cooling schedule for simulated annealing
DOI10.1007/S10898-006-9068-2zbMATH Open1182.90102OpenAlexW1963972143MaRDI QIDQ2460137FDOQ2460137
Authors: Yanfang Shen, Seksan Kiatsupaibul, Zelda B. Zabinsky, Robert L. Smith 
Publication date: 14 November 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9068-2
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Generalized Simulated Annealing for Function Optimization
- Optimization by simulated annealing
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Equation of State Calculations by Fast Computing Machines
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Pure adaptive search in global optimization
- Stochastic adaptive search for global optimization.
- Cooling Schedules for Optimal Annealing
- Letter to the Editor—-A Closed Form Solution of Certain Programming Problems
- Title not available (Why is that?)
- Simulated annealing for constrained global optimization
- Global optimization and simulated annealing
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- A simulated annealing algorithm with constant temperature for discrete stochastic optimization
- Simulated annealing with an optimal fixed temperature
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Simulated annealing: An introduction
Cited In (16)
- A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm
- Computational Science and Its Applications – ICCSA 2004
- Determination of discrete relaxation spectra using simulated annealing.
- Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise
- Pattern hit-and-run for sampling efficiently on polytopes
- Pattern discrete and mixed hit-and-run for global optimization
- An improved annealing method and its large-time behavior
- Meta-control of an interacting-particle algorithm for global optimization
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Determination of initial temperature in fast simulated annealing
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization
- A comparison of simulated annealing cooling strategies
- An ‘excursion’ approach to an annealing problem
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
- The interacting-particle algorithm with dynamic heating and cooling
- The optimal simulated annealing schedule for a simple model
Uses Software
This page was built for publication: An analytically derived cooling schedule for simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460137)
