방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 확률적 혼합 정수 계획법× | 불확실성 하에서 다중 상충 목표를 최적화하는 확률적 다목표 최적화× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도 | 1990s–2000s | 1990s–2000s |
| 창시자≠ | Birge, J. R.; Louveaux, F.; Sen, S. | Various (Fonseca, Fleming, Deb, Zitzler, and others) |
| 유형≠ | Stochastic optimization model | Stochastic metaheuristic optimization |
| 원전≠ | Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research. New York: Springer. ISBN: 9780387982175 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 별칭 | SMIP, Stochastic MIP, Mixed-Integer Stochastic Programming, SMILP | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization |
| 관련 | 5 | 5 |
| 요약≠ | Stochastic Mixed-Integer Programming (SMIP) is an optimization framework that finds the best mix of binary, integer, and continuous decisions when key parameters — costs, demands, capacities — are uncertain and modeled as probability distributions over a set of scenarios. It extends classical MIP by embedding scenario trees or expected-value objectives that hedge against uncertainty while respecting combinatorial constraints. | 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데이터셋 ↗ |
|
|