Porównaj metody

	Robust Tabu Search	Solidny algorytm genetyczny
Dziedzina	Symulacja	Symulacja
Rodzina	Process / pipeline	Process / pipeline
Rok powstania	1989 (TS); robust variant ~2000s	2005 (systematic survey); earlier applications from late 1990s
Twórca	Glover, F. (Tabu Search); robustness extensions by various authors	Jin, Y. and Branke, J. (systematic formalization); roots in Holland (1975)
Typ	Metaheuristic with robustness mechanism	Metaheuristic evolutionary optimizer with robustness mechanism
Źródło pierwotne	Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206.	Jin, Y., Branke, J. (2005). Evolutionary optimization in uncertain environments — a survey. IEEE Transactions on Evolutionary Computation, 9(3), 303–317.
Inne nazwy	RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty	RGA, Robust GA, Uncertainty-Aware Genetic Algorithm, Noise-Tolerant Genetic Algorithm
Pokrewne	6	6
Podsumowanie	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.	The Robust Genetic Algorithm (RGA) extends standard genetic algorithms to find solutions that perform well not only at the nominal design point but also when subjected to uncertainty in decision variables, parameters, or fitness evaluations. By incorporating explicit robustness measures into selection pressure, RGA balances optimality against sensitivity to perturbation, making it suitable for engineering design, scheduling, and policy optimization under real-world variability.