方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机目标规划× | 随机多目标优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1968 | 1990s–2000s |
| 提出者≠ | Contini, B. (building on Charnes & Cooper's chance-constrained programming) | Various (Fonseca, Fleming, Deb, Zitzler, and others) |
| 类型≠ | Stochastic multi-goal optimization | Stochastic metaheuristic optimization |
| 开创性文献≠ | Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 别名 | SGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization |
| 相关≠ | 6 | 5 |
| 摘要≠ | Stochastic Goal Programming (SGP) extends classical goal programming to handle uncertainty in goal targets, constraint coefficients, or right-hand-side parameters. By incorporating probabilistic constraints and stochastic objective components, it finds solutions that satisfy multiple goals at acceptable probability levels, making it suitable for decision problems where data are inherently uncertain or variable. | Stochastic Multi-Objective Optimization (SMOO) is a class of methods that simultaneously optimizes two or more conflicting objectives when parameters, costs, or constraints are uncertain or random. Rather than a single optimal solution, it produces a Pareto front of non-dominated solutions, each representing a different balance among objectives under the modeled uncertainty. |
| ScholarGate数据集 ↗ |
|
|