Porovnať metódy

	Robustná Tabu Hľadanie	Stochastické vyhľadávanie s tabu (Stochastic Tabu Search
Odbor	Simulácia	Simulácia
Rodina	Process / pipeline	Process / pipeline
Rok vzniku	1989 (TS); robust variant ~2000s	1990s
Tvorca	Glover, F. (Tabu Search); robustness extensions by various authors	Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s)
Typ	Metaheuristic with robustness mechanism	Stochastic metaheuristic optimizer
Pôvodný zdroj	Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206.	Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94.
Ďalšie názvy	RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty	STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search
Príbuzné	6	5
Zhrnutie	Robust Tabu Search (RTS) extends the classical Tabu Search metaheuristic by evaluating candidate solutions not only on their nominal objective value but also on their performance under uncertainty. Instead of seeking the best solution for a single scenario, RTS seeks solutions that perform well across a range of scenarios or realizations, trading peak optimality for reliability.	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.