方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 鲁棒粒子群优化× | 粒子群优化 (PSO)× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2000s | 1995 |
| 提出者≠ | Kennedy, J. & Eberhart, R. C. (PSO); robustness extensions by multiple authors, 2000s | — |
| 类型≠ | Metaheuristic — robust swarm-based optimizer | Population-based metaheuristic / swarm intelligence |
| 开创性文献≠ | Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm Intelligence. Morgan Kaufmann Publishers. ISBN: 9781558605954 | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| 别名≠ | Robust PSO, RPSO, Uncertainty-robust PSO, PSO with robustness | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| 相关 | 6 | 6 |
| 摘要≠ | Robust Particle Swarm Optimization (Robust PSO) extends the classical PSO metaheuristic to explicitly account for uncertainty in the objective function, constraints, or decision variables. Rather than optimizing a single nominal objective, each candidate solution is evaluated over a set of uncertainty scenarios, and fitness is judged by a robustness criterion such as worst-case performance or expected value, yielding solutions that remain near-optimal even when conditions deviate from nominal assumptions. | Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems. |
| ScholarGate数据集 ↗ |
|
|