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.
| Thuật toán Tabu Mạnh mẽ× | Tìm kiếm Cấm kỵ× | |
|---|---|---|
| Lĩnh vực≠ | Mô phỏng | Tối ưu hóa |
| Họ | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 1989 (TS); robust variant ~2000s | 1989 |
| Người khởi xướng≠ | Glover, F. (Tabu Search); robustness extensions by various authors | Fred Glover |
| Loại≠ | Metaheuristic with robustness mechanism | Local-search metaheuristic |
| Công trình gốc | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Tên gọi khác≠ | RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Liên quan≠ | 6 | 4 |
| Tóm tắt≠ | Robust Tabu Search (RTS) extends the classical Tabu Search metaheuristic by evaluating candidate solutions not only on their nominal objective value but also on their performance under uncertainty. Instead of seeking the best solution for a single scenario, RTS seeks solutions that perform well across a range of scenarios or realizations, trading peak optimality for reliability. | 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 ↗ |
|
|