方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 确定性遗传算法× | 随机遗传算法× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1975–1989 | 1975 |
| 提出者≠ | Goldberg, D. E.; Holland, J. H. | Holland, J. H. |
| 类型≠ | Deterministic evolutionary optimization | Stochastic evolutionary metaheuristic |
| 开创性文献≠ | Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA. ISBN: 9780201157673 | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110 |
| 别名 | DGA, Deterministic EA, Deterministic Evolutionary Algorithm, Deterministic Selection GA | SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm |
| 相关 | 5 | 5 |
| 摘要≠ | A Deterministic Genetic Algorithm (DGA) applies the structural framework of evolutionary computation — population, selection, crossover, and replacement — using entirely deterministic operators and fixed decision rules instead of stochastic sampling. By eliminating randomness, the algorithm becomes fully reproducible: running it twice on the same problem yields identical solutions, making it tractable for rigorous benchmarking, reproducibility studies, and systems where stochasticity is undesirable. | 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. |
| ScholarGate数据集 ↗ |
|
|