方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 策略情景遗传算法× | 多目标遗传算法 (MOGA)× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1975 (GA); 2000s (policy scenario application) | 1984 |
| 提出者≠ | Holland, J. H. (GA foundation); Lempert, Popper & Bankes (policy scenario search) | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) |
| 类型≠ | Evolutionary metaheuristic for policy scenario exploration | Population-based evolutionary optimizer |
| 开创性文献≠ | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI. ISBN: 9780262581110 | Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673 |
| 别名 | PSGA, Policy-GA, Policy Optimization Genetic Algorithm, Evolutionary Policy Scenario Search | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO |
| 相关 | 4 | 4 |
| 摘要≠ | 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 Multi-Objective Genetic Algorithm (MOGA) is an evolutionary computation method that evolves a population of candidate solutions toward a Pareto-optimal front, simultaneously optimizing two or more conflicting objective functions. It avoids collapsing trade-offs into a single score, instead producing a set of non-dominated solutions for the decision-maker to choose among. |
| ScholarGate数据集 ↗ |
|
|