方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| Robust NSGA-II× | 鲁棒多目标优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份 | 2006 | 2006 |
| 提出者≠ | Kalyanmoy Deb and Himanshu Gupta | Deb, K. & Gupta, H. |
| 类型≠ | Robust evolutionary multi-objective optimization algorithm | Optimization framework |
| 开创性文献≠ | Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182-197. DOI ↗ | Deb, K., & Gupta, H. (2006). Introducing robustness in multi-objective optimization. Evolutionary Computation, 14(4), 463–494. DOI ↗ |
| 别名 | Robust NSGA2, NSGA-II under uncertainty, Uncertainty-aware NSGA-II, RNSGA-II | RMOO, Robust MOO, Robust Pareto Optimization, Uncertainty-Robust Multi-Objective Optimization |
| 相关≠ | 5 | 4 |
| 摘要≠ | Robust NSGA-II extends the classic NSGA-II evolutionary algorithm to account for parametric uncertainty, finding Pareto-optimal trade-off solutions that remain high-performing even when input parameters deviate from their nominal values. Instead of optimizing objective values at a single point, it evaluates each candidate solution across a range or distribution of uncertainty realizations and selects for robustness alongside Pareto dominance. | Robust Multi-Objective Optimization (RMOO) is a framework for finding solutions that simultaneously optimize multiple conflicting objectives while remaining insensitive to perturbations in decision variables or problem parameters. Unlike classical MOO, RMOO explicitly incorporates uncertainty into the optimization loop, producing a robust Pareto front whose members perform well not only at the nominal design point but also across a neighbourhood of plausible operating conditions. |
| ScholarGate数据集 ↗ |
|
|