Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Ant Colony Optimization× | Particle Swarm Optimization (PSO)× | |
|---|---|---|
| Bidang | Pengoptimuman | Pengoptimuman |
| Keluarga | Process / pipeline | Process / pipeline |
| Tahun asal≠ | 1992 (foundational thesis); 1997 (Ant Colony System formalization) | 1995 |
| Pengasas | — | — |
| Jenis≠ | Metaheuristic — swarm intelligence | Population-based metaheuristic / swarm intelligence |
| Sumber perintis≠ | Dorigo, M. & Gambardella, L.M. (1997). Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1), 53-66. DOI ↗ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| Alias | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Berkaitan≠ | 5 | 6 |
| Ringkasan≠ | Ant Colony Optimization (ACO) is a metaheuristic algorithm introduced by Marco Dorigo and colleagues in the early 1990s that solves combinatorial optimisation problems by simulating the collective foraging behaviour of ants. Real ants lay pheromone trails on paths and preferentially follow stronger trails; ACO turns this positive-feedback mechanism into a search procedure that finds high-quality solutions to graph-structured problems such as the Travelling Salesman Problem, vehicle routing, and scheduling. | 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. |
| ScholarGateSet data ↗ |
|
|