방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 산술 최적화 알고리즘× | 입자 군집 최적화 (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데이터셋 ↗ |
|
|