Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Арифметичний алгоритм оптимізації× | Оптимізація роєм частинок (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Набір даних ↗ |
|
|