方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯遗传算法× | 贝叶斯多目标优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1999 | 2006-2016 |
| 提出者≠ | Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. | Emmerich, M.; Svenson, J.; and related Gaussian process optimization community |
| 类型≠ | Evolutionary metaheuristic with Bayesian probabilistic model | Surrogate-model-assisted multi-objective optimizer |
| 开创性文献≠ | Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999), pp. 525–532. Morgan Kaufmann. link ↗ | Svenson, J., Santner, T. (2016). Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models. Computational Statistics & Data Analysis, 94, 250-264. DOI ↗ |
| 别名 | BGA, Bayesian-guided GA, Probabilistic GA, EDA-GA | BMOO, Bayesian MOO, Multi-objective Bayesian optimization, MOBO |
| 相关≠ | 5 | 3 |
| 摘要≠ | A Bayesian Genetic Algorithm (BGA) replaces traditional crossover and mutation operators with a probabilistic Bayesian network learned from selected high-fitness individuals. At each generation the algorithm builds a graphical model of promising solution structure, then samples new offspring from that model, enabling the search to capture and exploit variable dependencies that standard GAs miss. | Bayesian Multi-Objective Optimization (BMOO/MOBO) uses Gaussian process surrogate models to approximate multiple expensive objective functions and guides the search toward the Pareto frontier with minimal real evaluations. By quantifying prediction uncertainty at each candidate point, it balances exploration of unknown regions against exploitation of promising solutions, making it especially powerful when each function evaluation is computationally or experimentally costly. |
| ScholarGate数据集 ↗ |
|
|