Process / pipelineSimulation / optimization
贝叶斯禁忌搜索 — 概率引导与基于记忆的局部搜索相结合
贝叶斯禁忌搜索 (BTS) 是一种混合元启发式算法，它将经典的禁忌搜索的基于记忆的禁止移动机制与贝叶斯概率模型相结合。贝叶斯组件从过去的评估中学习以对候选移动进行评分，将搜索集中在有希望的区域，而禁忌列表可防止循环。这种组合减少了昂贵的组合和连续优化问题中浪费的函数评估。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI: 10.1287/ijoc.1.3.190 ↗
- Bergstra, J., Bardenet, R., Bengio, Y., Kegl, B. (2011). Algorithms for hyper-parameter optimization. Advances in Neural Information Processing Systems (NIPS), 24, 2546–2554. link ↗
如何引用本页
ScholarGate. (2026, June 3). Bayesian Tabu Search — Probabilistic guidance integrated with memory-based local search. ScholarGate. https://scholargate.app/zh/simulation/bayesian-tabu-search
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →