方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 算术优化算法× | 粒子群优化 (PSO)× | |
|---|---|---|
| 领域 | 优化 | 优化 |
| 方法族≠ | Machine learning | Process / pipeline |
| 起源年份≠ | 2020 | 1995 |
| 提出者≠ | Laith Abualigah | — |
| 类型≠ | Mathematical metaheuristic algorithm | Population-based metaheuristic / swarm intelligence |
| 开创性文献≠ | Abualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al-qaness, M. A., & Gandomi, A. H. (2021). Arithmetic optimization algorithm: A new metaheuristic algorithm for solving optimization problems. Applied Mathematics and Computation, 392, 125450. link ↗ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| 别名≠ | AOA | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| 相关≠ | 5 | 6 |
| 摘要≠ | The Arithmetic Optimization Algorithm (AOA) is a metaheuristic optimization approach introduced by Abualigah et al. in 2020 that leverages mathematical operators (multiplication, division, addition, subtraction) as the inspiration for search strategies. Unlike nature-inspired algorithms, AOA uses the inherent properties of arithmetic operations to balance exploration and exploitation, making it particularly effective for mathematical optimization problems. | 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数据集 ↗ |
|
|