ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

برنامه‌ریزی پویا تصادفی×بهینه‌سازی تصادفی چندهدفه×
حوزهشبیه‌سازیشبیه‌سازی
خانوادهProcess / pipelineProcess / pipeline
سال پیدایش19571990s–2000s
پدیدآورBellman, R.; formalized for stochastic settings by Puterman, M. L.Various (Fonseca, Fleming, Deb, Zitzler, and others)
نوعSequential optimization under uncertaintyStochastic metaheuristic optimization
منبع بنیادینBellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396
نام‌های دیگرSDP, Markov Decision Process, MDP, Stochastic DPSMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization
مرتبط65
خلاصه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.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مجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Stochastic Dynamic Programming · Stochastic Multi-Objective Optimization. بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare