方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯遗传算法× | 随机遗传算法× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1999 | 1975 |
| 提出者≠ | Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. | Holland, J. H. |
| 类型≠ | Evolutionary metaheuristic with Bayesian probabilistic model | Stochastic evolutionary metaheuristic |
| 开创性文献≠ | Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999), pp. 525–532. Morgan Kaufmann. link ↗ | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110 |
| 别名 | BGA, Bayesian-guided GA, Probabilistic GA, EDA-GA | SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm |
| 相关 | 5 | 5 |
| 摘要≠ | A Bayesian Genetic Algorithm (BGA) replaces traditional crossover and mutation operators with a probabilistic Bayesian network learned from selected high-fitness individuals. At each generation the algorithm builds a graphical model of promising solution structure, then samples new offspring from that model, enabling the search to capture and exploit variable dependencies that standard GAs miss. | 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数据集 ↗ |
|
|