So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Tối ưu hóa Bầy Ong Nhân tạo (ABC)× | Thuật toán di truyền× | Tối ưu hóa Bầy đàn Hạt (PSO)× | |
|---|---|---|---|
| Lĩnh vực | Tối ưu hóa | Tối ưu hóa | Tối ưu hóa |
| Họ | Process / pipeline | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 2007 | 1975 | 1995 |
| Người khởi xướng≠ | Dervis Karaboga & Bahriye Basturk | John Henry Holland | — |
| Loại≠ | Swarm Intelligence Metaheuristic | Population-based metaheuristic | Population-based metaheuristic / swarm intelligence |
| Công trình gốc≠ | Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization, 39(3), 459–471. DOI ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| Tên gọi khác≠ | ABC Algorithm, Bee Colony Optimization, Swarm-Based Bee Search, Yapay Arı Kolonisi | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Liên quan≠ | 3 | 5 | 6 |
| Tóm tắt≠ | Artificial Bee Colony (ABC) is a population-based swarm intelligence metaheuristic introduced by Karaboga and Basturk in 2007. It models the cooperative foraging behavior of a honey bee colony to search for optimal solutions in continuous numerical optimization problems. The algorithm divides candidate solutions among three bee types — employed, onlooker, and scout — and iteratively refines them through local search and probabilistic selection, making it well-suited for researchers and engineers tackling complex, multimodal optimization landscapes. | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|
|