ScholarGate
Msaidizi
Process / pipelineSimulation / optimization

Kupasha joto kwa uhakika — Uboreshaji wa ratiba ya kupasha joto bila kukubali kwa bahati nasibu

Kupasha joto kwa uhakika (DSA) ni metaheuristic ya uboreshaji ambayo hupitisha muundo wa ratiba ya kupoza wa kupasha joto kwa uhakika wa kawaida lakini hubadilisha kigezo cha kukubali cha Metropolis chenye uwezekano na sheria madhubuti ya uhakika: ni hatua zinazoboresha tu ndizo zinazokubaliwa. Hii inatoa utaratibu wa kushuka kwa ulafi unaoweza kurudiwa, unaoongozwa na ratiba ya joto ya kupasha joto.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

Kupasha joto kwa uhakika
Simulated AnnealingUtafutaji Tabu

Vyanzo

  1. 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
  2. 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

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 3). Deterministic Simulated Annealing — Annealing-schedule optimization without stochastic acceptance. ScholarGate. https://scholargate.app/sw/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.

Compare side by side
ScholarGateDeterministic Simulated Annealing (Deterministic Simulated Annealing — Annealing-schedule optimization without stochastic acceptance). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/simulation/deterministic-simulated-annealing · Seti ya data: https://doi.org/10.5281/zenodo.20539026