Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Optimització Estocàstica Multiobjectiu×Programació Dinàmica Estocàstica×
CampSimulacióSimulació
FamíliaProcess / pipelineProcess / pipeline
Any d'origen1990s–2000s1957
Autor originalVarious (Fonseca, Fleming, Deb, Zitzler, and others)Bellman, R.; formalized for stochastic settings by Puterman, M. L.
TipusStochastic metaheuristic optimizationSequential optimization under uncertainty
Font seminalDeb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093
ÀliesSMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimizationSDP, Markov Decision Process, MDP, Stochastic DP
Relacionats56
ResumStochastic 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.
ScholarGateConjunt de dades
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED

Ves a la cerca Download slides

ScholarGateCompara mètodes: Stochastic Multi-Objective Optimization · Stochastic Dynamic Programming. Recuperat el 2026-06-15 de https://scholargate.app/ca/compare