方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机粒子群优化× | 多目标粒子群优化 (MOPSO)× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1995–2002 | 2004 |
| 提出者≠ | Kennedy, J. and Eberhart, R. (base PSO); stochastic extensions by Clerc, Kennedy and community | Coello Coello, C. A., Pulido, G. T., & Lechuga, M. S. |
| 类型≠ | Metaheuristic optimization — stochastic swarm intelligence | Population-based swarm 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 ↗ | 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 ↗ |
| 别名 | Stochastic PSO, SPSO, Randomized PSO, Probabilistic PSO | MOPSO, Multi-objective PSO, Pareto PSO, Vector-evaluated PSO |
| 相关≠ | 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. | 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数据集 ↗ |
|
|