Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Policy Scenario Genetic Algorithm× | Multiobjektiv genetisk algoritm (MOGA)× | |
|---|---|---|
| Ämnesområde | Simulering | Simulering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1975 (GA); 2000s (policy scenario application) | 1984 |
| Upphovsperson≠ | Holland, J. H. (GA foundation); Lempert, Popper & Bankes (policy scenario search) | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) |
| Typ≠ | Evolutionary metaheuristic for policy scenario exploration | Population-based evolutionary optimizer |
| Ursprungskälla≠ | 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 |
| Alias | PSGA, Policy-GA, Policy Optimization Genetic Algorithm, Evolutionary Policy Scenario Search | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|