方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机遗传算法× | 遗传算法× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份 | 1975 | 1975 |
| 提出者≠ | Holland, J. H. | John Henry Holland |
| 类型≠ | Stochastic evolutionary metaheuristic | Population-based metaheuristic |
| 开创性文献≠ | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110 | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| 别名≠ | SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| 相关 | 5 | 5 |
| 摘要≠ | The Stochastic Genetic Algorithm (SGA) is a population-based metaheuristic that mimics biological evolution — selection, crossover, and mutation — to search for near-optimal solutions in complex, nonlinear, or combinatorial spaces. Its randomized operators make it robust to local optima and broadly applicable across engineering, scheduling, machine learning, and operations research. | 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数据集 ↗ |
|
|