เปรียบเทียบวิธี

	Stochastic Tabu Search	Simulated Annealing
สาขาวิชา	การจำลอง	การหาค่าเหมาะที่สุด
ตระกูล	Process / pipeline	Process / pipeline
ปีกำเนิด	1990s	1983
ผู้ริเริ่ม	Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s)	—
ประเภท	Stochastic metaheuristic optimizer	Probabilistic metaheuristic / local search
แหล่งต้นตำรับ	Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94.	Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680.
ชื่อเรียกอื่น	STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search	Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search
ที่เกี่ยวข้อง	5	5
สรุป	Stochastic Tabu Search (STS) is an extension of classical Tabu Search that introduces randomness into the neighborhood exploration and move-selection phases. By combining tabu memory — which forbids recently visited solutions — with probabilistic acceptance or random candidate sampling, STS escapes local optima more effectively and explores rugged solution landscapes that deterministic TS may fail to traverse.	Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems.