方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒禁忌搜索× | 鲁棒粒子群优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1989 (TS); robust variant ~2000s | 2000s |
| 提出者≠ | Glover, F. (Tabu Search); robustness extensions by various authors | Kennedy, J. & Eberhart, R. C. (PSO); robustness extensions by multiple authors, 2000s |
| 类型≠ | Metaheuristic with robustness mechanism | Metaheuristic — robust swarm-based optimizer |
| 开创性文献≠ | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm Intelligence. Morgan Kaufmann Publishers. ISBN: 9781558605954 |
| 别名 | RTS, Robust TS, Uncertainty-aware Tabu Search, Tabu Search under Uncertainty | Robust PSO, RPSO, Uncertainty-robust PSO, PSO with robustness |
| 相关 | 6 | 6 |
| 摘要≠ | 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 Particle Swarm Optimization (Robust PSO) extends the classical PSO metaheuristic to explicitly account for uncertainty in the objective function, constraints, or decision variables. Rather than optimizing a single nominal objective, each candidate solution is evaluated over a set of uncertainty scenarios, and fitness is judged by a robustness criterion such as worst-case performance or expected value, yielding solutions that remain near-optimal even when conditions deviate from nominal assumptions. |
| ScholarGate数据集 ↗ |
|
|