방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 확률적 목표 계획법× | 불확실성 하에서 다중 상충 목표를 최적화하는 확률적 다목표 최적화× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1968 | 1990s–2000s |
| 창시자≠ | Contini, B. (building on Charnes & Cooper's chance-constrained programming) | Various (Fonseca, Fleming, Deb, Zitzler, and others) |
| 유형≠ | Stochastic multi-goal optimization | Stochastic metaheuristic optimization |
| 원전≠ | Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 별칭 | SGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization |
| 관련≠ | 6 | 5 |
| 요약≠ | Stochastic Goal Programming (SGP) extends classical goal programming to handle uncertainty in goal targets, constraint coefficients, or right-hand-side parameters. By incorporating probabilistic constraints and stochastic objective components, it finds solutions that satisfy multiple goals at acceptable probability levels, making it suitable for decision problems where data are inherently uncertain or variable. | 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. |
| ScholarGate데이터셋 ↗ |
|
|