방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이지안 다목적 최적화× | 다목적 최적화× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 2006-2016 | 1896 (concept); 1989–2002 (evolutionary algorithms era) |
| 창시자≠ | Emmerich, M.; Svenson, J.; and related Gaussian process optimization community | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. |
| 유형≠ | Surrogate-model-assisted multi-objective optimizer | Optimization framework |
| 원전≠ | Svenson, J., Santner, T. (2016). Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models. Computational Statistics & Data Analysis, 94, 250-264. DOI ↗ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 별칭 | BMOO, Bayesian MOO, Multi-objective Bayesian optimization, MOBO | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization |
| 관련 | 3 | 3 |
| 요약≠ | 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. | 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데이터셋 ↗ |
|
|