方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯禁忌搜索× | 随机禁忌搜索× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1989 (tabu search); hybrid formulations ~2005–2015 | 1990s |
| 提出者≠ | Glover, F. (tabu search); Bayesian integration developed by multiple researchers in the 2000s–2010s | Glover, F. (base TS); stochastic extensions by various authors (1990s–2000s) |
| 类型≠ | Hybrid metaheuristic — memory-based local search with Bayesian probabilistic guidance | Stochastic metaheuristic optimizer |
| 开创性文献≠ | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Glover, F. (1990). Tabu search: A tutorial. Interfaces, 20(4), 74-94. DOI ↗ |
| 别名 | BTS, Bayesian-guided tabu search, probabilistic tabu search, Bayes-TS | STS, Randomized Tabu Search, Probabilistic Tabu Search, Noisy Tabu Search |
| 相关≠ | 6 | 5 |
| 摘要≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|