ScholarGate
助手
Process / pipeline

禁忌搜索 — 局部搜索元启发式算法

禁忌搜索(Tabu Search)是由Fred Glover于1989年提出的一种局部搜索元启发式算法。它使用一个禁忌列表(tabu list)——一个记录近期访问过的解的短期记忆——来防止循环并跳出局部最优。通过明确禁止逆转近期决策的移动,该算法能够更广泛地探索搜索空间,并通过诸如渴望准则(aspiration criteria)之类的长期记忆结构,即使在大型、复杂的组合优化问题中,也能趋向于全局最优。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

The neighbourhood of related methods — select a node to explore.

+5 more

来源

  1. Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link
  2. Glover, F. & Laguna, M. (1997). Tabu Search. Springer. ISBN: 9780792349907

如何引用本页

ScholarGate. (2026, June 1). Tabu Search (Tabu Search Metaheuristic). ScholarGate. https://scholargate.app/zh/optimization/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

被引用于

ScholarGateTabu Search (Tabu Search (Tabu Search Metaheuristic)). 于 2026-06-15 检索自 https://scholargate.app/zh/optimization/tabu-search · 数据集: https://doi.org/10.5281/zenodo.20539026