Convergence of Simulated Annealing with Feedback Temperature Schedules
From MaRDI portal
Publication:5488541
DOI10.1017/S0269964800004836zbMath1096.90553MaRDI QIDQ5488541
No author found.
Publication date: 22 September 2006
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Special processes (60K99) Markov processes (60J99)
Related Items (3)
Analysing stability and investments in railway networks using advanced evolutionary algorithms ⋮ Some new results on simulated annealing applied to the job shop scheduling problem ⋮ The interacting-particle algorithm with dynamic heating and cooling
Cites Work
- Convergence of an annealing algorithm
- Convergence and finite-time behavior of simulated annealing
- Simulated annealing methods with general acceptance probabilities
- Cooling Schedules for Optimal Annealing
- Note on the Convergence of Simulated Annealing Algorithms
- Job Shop Scheduling by Simulated Annealing
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A piecewise Markovian model for simulated annealing with stochastic cooling schedules
- Perturbation theory and finite Markov chains
This page was built for publication: Convergence of Simulated Annealing with Feedback Temperature Schedules
