Porównaj metody

	Bayesian Tabu Search	Przeszukiwanie tabu
Dziedzina	Symulacja	Optymalizacja
Rodzina	Process / pipeline	Process / pipeline
Rok powstania	1989 (tabu search); hybrid formulations ~2005–2015	1989
Twórca	Glover, F. (tabu search); Bayesian integration developed by multiple researchers in the 2000s–2010s	Fred Glover
Typ	Hybrid metaheuristic — memory-based local search with Bayesian probabilistic guidance	Local-search metaheuristic
Źródło pierwotne	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.
Inne nazwy	BTS, Bayesian-guided tabu search, probabilistic tabu search, Bayes-TS	Tabu Araması (Tabu Search), TS, tabu metaheuristic
Pokrewne	6	4
Podsumowanie	Bayesian Tabu Search (BTS) is a hybrid metaheuristic that couples the memory-based forbidden-move mechanism of classic Tabu Search with a Bayesian probabilistic model. The Bayesian component learns from past evaluations to score candidate moves, focusing the search on promising regions while the tabu list prevents cycling. This combination reduces wasted function evaluations in expensive combinatorial and continuous optimization problems.	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.