Porównaj metody

	Agent-Based Ant Colony Optimization	Optymalizacja rojem cząstek (PSO)
Dziedzina	Symulacja	Optymalizacja
Rodzina	Process / pipeline	Process / pipeline
Rok powstania	1992-2004	1995
Twórca	Dorigo, M. and colleagues; agent-based framing developed in swarm intelligence community	—
Typ	Metaheuristic optimization — agent-based swarm simulation	Population-based metaheuristic / swarm intelligence
Źródło pierwotne	Dorigo, M., Stutzle, T. (2004). Ant Colony Optimization. MIT Press, Cambridge, MA. ISBN: 9780262042192	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
Inne nazwy	AB-ACO, Agent-Based ACO, Multi-Agent Ant Colony Optimization, MAACO	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Pokrewne	5	6
Podsumowanie	Agent-Based Ant Colony Optimization (AB-ACO) models individual ants as autonomous agents that probabilistically construct solutions by following and depositing pheromone trails on a search graph. By coupling agent-level behavioral rules with a shared pheromone environment, the collective system converges on high-quality solutions to hard combinatorial and simulation-embedded optimization problems without central coordination.	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.