Comparative Analysis of Two Different Ant Colony Algorithm for Model of TSP

Travelling Salesman Problem is well - known and extensively studied problem which plays an important role in combinatorial optimization and in context of ACO. Ant Colony Optimization is heuristic Algorithm which was initially applied on TSP and is an advance technique applied on various other optimization problems. In the research we study two different kinds of Ant Colony algorithms named as Ant System and the improved version of Ant system known as Max-Min Ant System performed in MATLAB to solve travelling Salesman Problem and their respective results are shown by using graphical implementation. In this paper both systems are analyzed by solving the same example of TSP and depict which system solve the problem efficiently with respect to cost and time.