方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯目标规划× | 多目标优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1990s | 1896 (concept); 1989–2002 (evolutionary algorithms era) |
| 提出者≠ | Rios Insua, D. and colleagues | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. |
| 类型≠ | Multi-objective optimization under uncertainty | Optimization framework |
| 开创性文献≠ | Rios Insua, D. (1990). Sensitivity Analysis in Multi-objective Decision Making. Springer-Verlag, Berlin. ISBN: 9783540528814 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 别名 | BGP, Bayesian GP, Probabilistic Goal Programming, Bayesian Multi-Goal Optimization | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization |
| 相关≠ | 6 | 3 |
| 摘要≠ | Bayesian Goal Programming (BGP) integrates Bayesian statistical inference with classic goal programming to handle uncertainty in targets and parameters. Instead of treating goal thresholds as fixed constants, BGP encodes them as probability distributions, updates beliefs using observed data, and then solves the resulting probabilistic optimization problem to find solutions that satisfy multiple aspirational goals under uncertainty. | 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数据集 ↗ |
|
|