مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| الگوریتم ژنتیک سناریوی خطمشی× | الگوریتم ژنتیک× | |
|---|---|---|
| حوزه≠ | شبیهسازی | بهینهسازی |
| خانواده | Process / pipeline | Process / pipeline |
| سال پیدایش≠ | 1975 (GA); 2000s (policy scenario application) | 1975 |
| پدیدآور≠ | Holland, J. H. (GA foundation); Lempert, Popper & Bankes (policy scenario search) | John Henry Holland |
| نوع≠ | Evolutionary metaheuristic for policy scenario exploration | Population-based metaheuristic |
| منبع بنیادین≠ | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI. ISBN: 9780262581110 | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| نامهای دیگر≠ | PSGA, Policy-GA, Policy Optimization Genetic Algorithm, Evolutionary Policy Scenario Search | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| مرتبط≠ | 4 | 5 |
| خلاصه≠ | The Policy Scenario Genetic Algorithm applies evolutionary search to systematically explore large, combinatorial policy alternative spaces under multiple future scenarios. Rather than exhaustively enumerating options, it breeds successive generations of candidate policies, retaining those that perform well across scenario conditions, yielding robust, high-performing policy recommendations. | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. |
| ScholarGateمجموعهداده ↗ |
|
|