ScholarGate
Asistent

Porovnať metódy

Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.

Stochastická multikriteriálna optimalizácia×Stochastické dynamické programovanie×
OdborSimuláciaSimulácia
RodinaProcess / pipelineProcess / pipeline
Rok vzniku1990s–2000s1957
TvorcaVarious (Fonseca, Fleming, Deb, Zitzler, and others)Bellman, R.; formalized for stochastic settings by Puterman, M. L.
TypStochastic metaheuristic optimizationSequential optimization under uncertainty
Pôvodný zdrojDeb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093
Ďalšie názvySMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimizationSDP, Markov Decision Process, MDP, Stochastic DP
Príbuzné56
ZhrnutieStochastic 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.
ScholarGateDátová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Stiahnuť snímky

ScholarGatePorovnať metódy: Stochastic Multi-Objective Optimization · Stochastic Dynamic Programming. Získané 2026-06-15 z https://scholargate.app/sk/compare