방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 불확실성 하에서 다중 상충 목표를 최적화하는 확률적 다목표 최적화× | 다목적 최적화× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1990s–2000s | 1896 (concept); 1989–2002 (evolutionary algorithms era) |
| 창시자≠ | Various (Fonseca, Fleming, Deb, Zitzler, and others) | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. |
| 유형≠ | Stochastic metaheuristic optimization | Optimization framework |
| 원전 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 별칭 | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization |
| 관련≠ | 5 | 3 |
| 요약≠ | 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. | 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데이터셋 ↗ |
|
|