方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 确定性多目标优化× | 多目标优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1951–1999 | 1896 (concept); 1989–2002 (evolutionary algorithms era) |
| 提出者≠ | Kuhn, H. W., Tucker, A. W. (Pareto optimality formalized); Miettinen, K. (systematic deterministic framework) | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. |
| 类型≠ | Optimization framework — deterministic Pareto and scalarization methods | Optimization framework |
| 开创性文献 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 978-0-471-87339-6 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 别名 | Deterministic MOO, Classical Multi-Objective Optimization, Non-Stochastic MOO, Deterministic Pareto Optimization | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization |
| 相关 | 3 | 3 |
| 摘要≠ | Deterministic Multi-Objective Optimization (Deterministic MOO) is a family of classical optimization approaches that simultaneously minimize or maximize multiple conflicting objective functions over a deterministic feasible set. It produces a Pareto front — the set of non-dominated solutions — from which a decision-maker selects the preferred trade-off. Unlike stochastic variants, all objective evaluations and constraints are fixed and noise-free. | Multi-Objective Optimization (MOO) is a mathematical and computational framework for finding solutions that simultaneously optimize two or more conflicting objective functions. Rather than collapsing all goals into a single scalar, MOO produces a set of trade-off solutions — the Pareto front — from which a decision-maker selects according to preference. It is widely used in engineering design, operations research, logistics, economics, and policy analysis. |
| ScholarGate数据集 ↗ |
|
|