Author(s): Renu Jangra, Dr. Ramesh Kait
A recently proposed algorithm named Ant colony optimization algorithm (ACO) is simple to merge with additional methods. The application of Ant Colony Optimization is much wider and it is always the key algorithm. A meta-heuristic algorithm Ant Colony optimization which is applied on the combinatorial optimized problems to get the optimal solution. Among common combinatorial problems one is Travelling-Salesman Problem (TSP). In this paper, we analyze the ACO algorithm with different parameters values using MATLAB tool. The analysis is shown in form of graph showing the optimal solution corresponding to the values set for the parameters