Sammenlign metoder

	Robust Tabu Search	Tabu Search – Lokalt søk metaheuristikk
Fagfelt	Simulering	Optimering
Familie	Process / pipeline	Process / pipeline
Opprinnelsesår	1989 (TS); robust variant ~2000s	1989
Opphavsperson	Glover, F. (Tabu Search); robustness extensions by various authors	Fred Glover
Type	Metaheuristic with robustness mechanism	Local-search metaheuristic
Opprinnelig kilde	Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206.	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.
Alias	RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty	Tabu Araması (Tabu Search), TS, tabu metaheuristic
Relaterte	6	4
Sammendrag	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.	Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems.