方法证据记录
Tabu Search
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.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Tabu Search (Tabu Search Metaheuristic)
分类方法记录 · process-pipeline / optimization
- Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. · URL
- Glover, F. & Laguna, M. (1997). Tabu Search. Springer. · ISBN 9780792349907
精选声明
声明已持久化到证据分类账中，每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时，此视图不会自行创建声明评估。
相关方法
从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。