方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯粒子群优化× | 多目标粒子群优化 (MOPSO)× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2003 | 2004 |
| 提出者≠ | Higashi, N., Iba, H. (extending Kennedy and Eberhart's PSO) | Coello Coello, C. A., Pulido, G. T., & Lechuga, M. S. |
| 类型≠ | Hybrid metaheuristic — Bayesian probabilistic swarm search | Population-based swarm metaheuristic |
| 开创性文献≠ | 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 ↗ | Coello Coello, C. A., Pulido, G. T., & Lechuga, M. S. (2004). Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 256–279. DOI ↗ |
| 别名 | Bayesian PSO, BPSO, Probabilistic Swarm Optimization, Prior-guided PSO | MOPSO, Multi-objective PSO, Pareto PSO, Vector-evaluated PSO |
| 相关≠ | 6 | 5 |
| 摘要≠ | 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. | Multi-Objective Particle Swarm Optimization (MOPSO) is a swarm-intelligence metaheuristic that extends the original Particle Swarm Optimization (PSO) to handle multiple conflicting objective functions simultaneously. It maintains an external Pareto archive and uses dominance-based selection to guide a population of candidate solutions toward the true Pareto front without requiring a priori preference information. |
| ScholarGate数据集 ↗ |
|
|