Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Ottimizzazione Stocastica Multi-Obiettivo× | Programmazione Dinamica Stocastica× | |
|---|---|---|
| Campo | Simulazione | Simulazione |
| Famiglia | Process / pipeline | Process / pipeline |
| Anno di origine≠ | 1990s–2000s | 1957 |
| Ideatore≠ | Various (Fonseca, Fleming, Deb, Zitzler, and others) | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| Tipo≠ | Stochastic metaheuristic optimization | Sequential optimization under uncertainty |
| Fonte seminale≠ | 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 |
| Alias | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization | SDP, Markov Decision Process, MDP, Stochastic DP |
| Correlati≠ | 5 | 6 |
| Sintesi≠ | 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. |
| ScholarGateInsieme di dati ↗ |
|
|