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

	Stochastic Tabu Search	ขั้นตอนวิธีเชิงพันธุกรรมแบบสุ่ม
สาขาวิชา	การจำลอง	การจำลอง
ตระกูล	Process / pipeline	Process / pipeline
ปีกำเนิด	1990s	1975
ผู้ริเริ่ม	Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s)	Holland, J. H.
ประเภท	Stochastic metaheuristic optimizer	Stochastic evolutionary metaheuristic
แหล่งต้นตำรับ	Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94.	Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110
ชื่อเรียกอื่น	STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search	SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm
ที่เกี่ยวข้อง	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.	The Stochastic Genetic Algorithm (SGA) is a population-based metaheuristic that mimics biological evolution — selection, crossover, and mutation — to search for near-optimal solutions in complex, nonlinear, or combinatorial spaces. Its randomized operators make it robust to local optima and broadly applicable across engineering, scheduling, machine learning, and operations research.