Abstract:
In this work we dealt with a hot topic of Comparative Study of Ant Colony Algorithms for
Multi-Objective Optimization where we touched on the basic process of ant colony algorithms
to solve MOPs to illustrate the differences between each step and then presented a complete
relative classification of the algorithms from different sides After that, given the classification
result, we performed We compared some typical algorithms that come from different classes
with different sizes of TSP (traveling salesman problem) examples and we analyzed the results
from the perspective of solution quality and convergence rate.
