Deterministic Simulated Annealing — Annealing-schedule optimization without stochastic acceptance
Also known as: DSA, Deterministic Annealing, Greedy Annealing, Temperature-Scheduled Descent
Deterministic Simulated Annealing (DSA) is an optimization metaheuristic that adopts the cooling-schedule structure of classical simulated annealing but replaces the probabilistic Metropolis acceptance criterion with a strictly deterministic rule: only improving moves are accepted. This yields a reproducible, greedy-descent procedure guided by an annealing temperature schedule.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use deterministic simulated annealing when full reproducibility of results is required across runs and the solution landscape is relatively smooth with few deep local optima. It is well-suited to problems where stochastic noise in the search is undesirable, such as embedded systems or certification-sensitive applications. It is also appropriate as a fast baseline to benchmark against stochastic SA. Do NOT use it when the problem has many local optima that require probabilistic escapes — in such cases, stochastic SA or population-based methods like genetic algorithms will significantly outperform DSA. Avoid DSA for highly multimodal landscapes where greedy acceptance systematically leads to premature convergence.
Strengths & limitations
- Fully reproducible: identical results on every run with the same initialization, enabling reliable benchmarking and certification.
- Computationally efficient: no random number generation or probability calculations at each step, reducing per-iteration overhead.
- Simple to implement and tune: the cooling schedule and neighborhood operator are the only design choices.
- Termination is predictable: the algorithm converges deterministically once no improving neighbor exists.
- Easy to parallelize: deterministic evaluation of neighbors allows safe concurrent exploration.
- Vulnerable to local optima: without probabilistic acceptance, the search cannot escape local minima, making solution quality highly dependent on initialization.
- Sensitive to neighborhood design: a poorly chosen perturbation operator leads to slow or premature convergence.
- The temperature schedule has limited effect on solution quality since it controls only neighborhood scope, not acceptance probability.
- May perform poorly compared to stochastic SA on highly multimodal landscapes where non-improving moves are necessary to find global optima.
Frequently asked
Is deterministic simulated annealing the same as greedy local search?
Largely yes in its acceptance rule — DSA only accepts improving moves. The key difference is that DSA applies an annealing temperature schedule that may control neighborhood size or perturbation magnitude, giving it a structured exploration phase distinct from a fixed-neighborhood greedy search.
Why use DSA instead of standard simulated annealing?
DSA is preferred when reproducibility is critical (e.g., regulated or auditable applications), when computational cost of random number generation matters, or when the problem landscape is smooth enough that stochastic escapes are unnecessary.
Can DSA guarantee finding the global optimum?
No. Unlike stochastic SA under appropriate cooling schedules, DSA has no theoretical guarantee of convergence to the global optimum. It converges to a local optimum dependent on the initial solution and neighborhood structure.
How does the temperature schedule matter in DSA if acceptance is deterministic?
In many DSA implementations, temperature governs the amplitude or scope of neighborhood perturbations rather than acceptance probability. A higher temperature allows larger perturbations that explore the space broadly; cooling narrows the search toward local refinement.
When is deterministic annealing preferable to tabu search?
DSA is simpler to implement and requires no memory structures. Tabu search explicitly records forbidden moves to escape local optima, making it more effective on rugged landscapes but more complex to configure. For smooth problems or tight implementation budgets, DSA is preferable.
Sources
- Rose, K., Gurewitz, E., Fox, G. C. (1990). A deterministic annealing approach to clustering. Pattern Recognition Letters, 11(9), 589-594. DOI: 10.1016/0167-8655(90)90010-Y ↗
- Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. DOI: 10.1126/science.220.4598.671 ↗
How to cite this page
ScholarGate. (2026, June 3). Deterministic Simulated Annealing — Annealing-schedule optimization without stochastic acceptance. ScholarGate. https://scholargate.app/en/simulation/deterministic-simulated-annealing
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Simulated AnnealingOptimization↔ compare
- Tabu SearchOptimization↔ compare