方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 多目标遗传算法 (MOGA)× | 遗传算法× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1984 | 1975 |
| 提出者≠ | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) | John Henry Holland |
| 类型≠ | Population-based evolutionary optimizer | Population-based metaheuristic |
| 开创性文献≠ | Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673 | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| 别名≠ | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| 相关≠ | 4 | 5 |
| 摘要≠ | 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. | 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数据集 ↗ |
|
|