Сравнение на методи

	Байесов алгоритъм на роя от мравки	Многокритериална оптимизация с алгоритъм на мравките (MOACO)
Област	Симулационно моделиране	Симулационно моделиране
Семейство	Process / pipeline	Process / pipeline
Година на възникване	1996 (ACO); Bayesian variant: 2000s	1999
Създател	Dorigo, M. et al. (ACO); Bayesian extensions by multiple researchers in the 2000s–2010s	Gambardella, Taillard & Agazzi; Dorigo & Stützle
Тип	Metaheuristic with Bayesian probabilistic learning	Population-based metaheuristic
Основополагащ източник	Dorigo, M., Maniezzo, V., Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 26(1), 29–41.	Gambardella, L. M., Taillard, E., & Agazzi, G. (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, & F. Glover (Eds.), New Ideas in Optimization (pp. 63–76). McGraw-Hill.
Други названия	BACO, Bayesian ACO, Bayesian-guided ACO, Probabilistic ACO	MOACO, Multi-Objective ACO, Pareto Ant Colony Optimization, Multi-objective ACO
Свързани	5	4
Резюме	Bayesian Ant Colony Optimization (BACO) is a hybrid metaheuristic that embeds Bayesian inference into the Ant Colony Optimization framework. By treating pheromone intensities or algorithm parameters as probability distributions updated with collected evidence, BACO improves convergence reliability and robustness compared to classical ACO on noisy or uncertain combinatorial optimization problems.	Multi-Objective Ant Colony Optimization (MOACO) is a swarm-intelligence metaheuristic that extends the classic Ant Colony Optimization framework to simultaneously optimize two or more conflicting objectives. Artificial ants construct candidate solutions guided by pheromone trails and heuristic information, progressively building an archive of Pareto-optimal solutions rather than converging to a single best answer.