Convergence of Simulated Annealing with Feedback Temperature Schedules
From MaRDI portal
Publication:5488541
Recommendations
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- On simulated annealing with temperature-dependent energy and temperature-dependent communication
- Optimization by simulated annealing: a necessary and sufficient condition for convergence
- Cooling Schedules for Optimal Annealing
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
Cites work
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A piecewise Markovian model for simulated annealing with stochastic cooling schedules
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- Convergence and finite-time behavior of simulated annealing
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- Job Shop Scheduling by Simulated Annealing
- Note on the Convergence of Simulated Annealing Algorithms
- Perturbation theory and finite Markov chains
- Simulated annealing methods with general acceptance probabilities
Cited in
(6)- Analysing stability and investments in railway networks using advanced evolutionary algorithms
- On simulated annealing with temperature-dependent energy and temperature-dependent communication
- An information guided framework for simulated annealing
- Adaptive temperature control for simulated annealing: a comparative study
- Some new results on simulated annealing applied to the job shop scheduling problem
- The interacting-particle algorithm with dynamic heating and cooling
This page was built for publication: Convergence of Simulated Annealing with Feedback Temperature Schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488541)
