方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒禁忌搜索× | 鲁棒模拟退火× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1989 (TS); robust variant ~2000s | 1983 (SA); robust variant emerged 1990s–2000s |
| 提出者≠ | Glover, F. (Tabu Search); robustness extensions by various authors | Kirkpatrick, Gelatt & Vecchi (SA basis); robust formulation developed across the operations research community |
| 类型≠ | Metaheuristic with robustness mechanism | Metaheuristic with robustness evaluation |
| 开创性文献≠ | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. DOI ↗ |
| 别名 | RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty | RSA, Robust SA, Uncertainty-robust simulated annealing, Worst-case simulated annealing |
| 相关≠ | 6 | 5 |
| 摘要≠ | 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. | Robust Simulated Annealing (RSA) adapts the classical simulated annealing metaheuristic to seek solutions that perform well not just under nominal conditions but across the full range of uncertain or adversarial parameter values. By embedding a robustness evaluation — worst-case, expected-case, or regret-based — into the SA acceptance step, RSA trades some nominal optimality for resilience, making it valuable when problem parameters are imprecisely known or subject to environmental variation. |
| ScholarGate数据集 ↗ |
|
|