השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| תכנון מטרות סטוכסטי – אופטימיזציה של מטרות מרובות תחת אי-ודאות× | אופטימיזציה סטוכסטית מרובת יעדים× | |
|---|---|---|
| תחום | סימולציה | סימולציה |
| משפחה | Process / pipeline | Process / pipeline |
| שנת המקור≠ | 1968 | 1990s–2000s |
| הוגה השיטה≠ | Contini, B. (building on Charnes & Cooper's chance-constrained programming) | Various (Fonseca, Fleming, Deb, Zitzler, and others) |
| סוג≠ | Stochastic multi-goal optimization | Stochastic metaheuristic optimization |
| מקור מכונן≠ | Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| כינויים | SGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming | SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization |
| קשורות≠ | 6 | 5 |
| תקציר≠ | Stochastic Goal Programming (SGP) extends classical goal programming to handle uncertainty in goal targets, constraint coefficients, or right-hand-side parameters. By incorporating probabilistic constraints and stochastic objective components, it finds solutions that satisfy multiple goals at acceptable probability levels, making it suitable for decision problems where data are inherently uncertain or variable. | 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מערך נתונים ↗ |
|
|