Simulated Annealing
Single-solution metaheuristic that accepts worse moves with decreasing probability.
Also called: Simulated Annealing · SA · 담금질 기법
A single-solution metaheuristic inspired by metallurgical annealing. Worse moves are accepted with high probability early (high temperature) to escape local optima, and that probability shrinks as the "temperature" cools, trading exploration for exploitation over time. In cutting & packing it searches over piece sequence, orientation, and placement neighborhoods with a constructive placement heuristic in the inner loop — one of several metaheuristics applied to 2D Irregular Nesting and Strip Packing.
Claims & evidence
Every relationship is a claim with an evidence grade; applicable problem-to-problem relationships also carry an equivalence level. See the evidence policy.
No claims recorded yet.