方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯粒子群优化× | 随机粒子群优化× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2003 | 1995–2002 |
| 提出者≠ | Higashi, N., Iba, H. (extending Kennedy and Eberhart's PSO) | Kennedy, J. and Eberhart, R. (base PSO); stochastic extensions by Clerc, Kennedy and community |
| 类型≠ | Hybrid metaheuristic — Bayesian probabilistic swarm search | Metaheuristic optimization — stochastic swarm intelligence |
| 开创性文献≠ | Higashi, N., Iba, H. (2003). Particle swarm optimization with Gaussian mutation. Proceedings of the 2003 IEEE Swarm Intelligence Symposium, Indianapolis, IN, USA, pp. 72-79. DOI ↗ | Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 - International Conference on Neural Networks, Vol. 4, pp. 1942-1948. IEEE. DOI ↗ |
| 别名 | Bayesian PSO, BPSO, Probabilistic Swarm Optimization, Prior-guided PSO | Stochastic PSO, SPSO, Randomized PSO, Probabilistic PSO |
| 相关≠ | 6 | 4 |
| 摘要≠ | Bayesian Particle Swarm Optimization (Bayesian PSO) integrates Bayesian probabilistic reasoning into the standard particle swarm framework. Particles update their velocities and positions guided not only by personal and global best positions but also by a Bayesian posterior that encodes prior knowledge about the solution space, enabling more directed and statistically principled exploration of complex optimization landscapes. | 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. |
| ScholarGate数据集 ↗ |
|
|