方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 政策情景粒子群优化× | 粒子群优化 (PSO)× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1995 (PSO); applied to policy scenarios from 2000s onward | 1995 |
| 提出者≠ | Kennedy, J. & Eberhart, R. (PSO); policy scenario framing from planning and operations research literature | — |
| 类型≠ | Metaheuristic optimization within policy scenario framework | Population-based metaheuristic / swarm intelligence |
| 开创性文献≠ | Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948. DOI ↗ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| 别名≠ | PS-PSO, Policy PSO, Scenario-based PSO, Policy scenario swarm optimization | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| 相关 | 6 | 6 |
| 摘要≠ | Policy Scenario Particle Swarm Optimization integrates Particle Swarm Optimization (PSO) with explicit policy scenario analysis. A swarm of candidate policy solutions is evaluated under multiple defined future scenarios, and PSO's velocity-position update rules guide the swarm toward solutions that perform well—or robustly—across all considered scenarios. It is used in energy, environmental, infrastructure, and public resource planning. | 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数据集 ↗ |
|
|