Deterministisk Simulated Annealing — Optimering af annealing-skema uden stokastisk accept
Deterministisk Simulated Annealing (DSA) er en optimerings-metaheuristik, der adopterer køleskemastrukturen fra klassisk simulated annealing, men erstatter det probabilistiske Metropolis acceptkriterium med en strengt deterministisk regel: kun forbedrende træk accepteres. Dette resulterer i en reproducerbar, grådig nedstigningsprocedure styret af et annealing-temperaturskema.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- 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 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Deterministic Simulated Annealing — Annealing-schedule optimization without stochastic acceptance. ScholarGate. https://scholargate.app/da/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 AnnealingOptimering↔ compare
- Tabu SearchOptimering↔ compare
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →