方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 约束规划× | 禁忌搜索× | |
|---|---|---|
| 领域 | 优化 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2006 | 1989 |
| 提出者≠ | Rossi, van Beek & Walsh | Fred Glover |
| 类型≠ | Declarative combinatorial optimization | Local-search metaheuristic |
| 开创性文献≠ | Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4 | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| 别名≠ | Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| 相关≠ | 3 | 4 |
| 摘要≠ | Constraint Programming (CP) is a declarative optimization paradigm in which a problem is formulated as a set of variables, finite domains, and constraints, and a solver systematically searches for assignments that satisfy all constraints. Formalized comprehensively by Rossi, van Beek, and Walsh in their 2006 Handbook of Constraint Programming, CP unifies propagation-based pruning with intelligent backtracking search to tackle combinatorial problems across scheduling, planning, and configuration domains. | 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. |
| ScholarGate数据集 ↗ |
|
|