So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Lập trình động× | Tìm kiếm Cấm kỵ× | |
|---|---|---|
| Lĩnh vực | Tối ưu hóa | Tối ưu hóa |
| Họ | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 1957 | 1989 |
| Người khởi xướng≠ | Richard Bellman | Fred Glover |
| Loại≠ | Exact combinatorial optimization via recursive decomposition | Local-search metaheuristic |
| Công trình gốc≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6 | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Tên gọi khác≠ | DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Liên quan≠ | 3 | 4 |
| Tóm tắt≠ | Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|