방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 불확실성 하에서 다중 상충 목표를 최적화하는 확률적 다목표 최적화× | 확률적 동적 계획법× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1990s–2000s | 1957 |
| 창시자≠ | Various (Fonseca, Fleming, Deb, Zitzler, and others) | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| 유형≠ | Stochastic metaheuristic optimization | Sequential optimization under uncertainty |
| 원전≠ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| 별칭 | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization | SDP, Markov Decision Process, MDP, Stochastic DP |
| 관련≠ | 5 | 6 |
| 요약≠ | 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. | Stochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods. |
| ScholarGate데이터셋 ↗ |
|
|