方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机粒子群优化× | 随机遗传算法× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1995–2002 | 1975 |
| 提出者≠ | Kennedy, J. and Eberhart, R. (base PSO); stochastic extensions by Clerc, Kennedy and community | Holland, J. H. |
| 类型≠ | Metaheuristic optimization — stochastic swarm intelligence | Stochastic evolutionary metaheuristic |
| 开创性文献≠ | Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 - International Conference on Neural Networks, Vol. 4, pp. 1942-1948. IEEE. DOI ↗ | Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. ISBN: 978-0262581110 |
| 别名 | Stochastic PSO, SPSO, Randomized PSO, Probabilistic PSO | SGA, Canonical Genetic Algorithm, Simple Genetic Algorithm, Evolutionary Algorithm |
| 相关≠ | 4 | 5 |
| 摘要≠ | Stochastic Particle Swarm Optimization (Stochastic PSO) is a swarm-intelligence metaheuristic that extends the standard PSO framework by incorporating explicit stochastic elements — random inertia weights, probabilistic velocity resets, or noise injections — to escape local optima and maintain population diversity throughout the search. It is widely applied to continuous, mixed, and noisy optimization problems in engineering, operations research, and simulation-based design. | 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数据集 ↗ |
|
|