ScholarGate
دستیار

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

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

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

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

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