方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机多目标优化× | 随机动态规划× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1990s–2000s | 1957 |
| 提出者≠ | Various (Fonseca, Fleming, Deb, Zitzler, and others) | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| 类型≠ | Stochastic metaheuristic optimization | Sequential optimization under uncertainty |
| 开创性文献≠ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| 别名 | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization | SDP, Markov Decision Process, MDP, Stochastic DP |
| 相关≠ | 5 | 6 |
| 摘要≠ | 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. | Stochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods. |
| ScholarGate数据集 ↗ |
|
|