Solution to TSP using ACO

Abstract

Ants show complex social behaviours which attracted the humans attraction .One of the attractable nature is formation of ant-streets. To solve several complex optimization problems several metaheuristic algorithms are used to find their best solution .Ant colony optimization technique is among the famous metaheuristic algorithm used for computing solution for dynamic problems .On the other hand,TSPis a widely famous  practical problem.

 In TSP a salesperson travels n cities or nodes in given time and after completing his tour him return back to starting city. In one tour he travel each city only for one time, and after completion of tour start from where he started. The problem is in which order should salesperson should travel the cities to minimize the  travelling distance ?  Travelling Salesman Problem is pictorial problem ,on basis of TSP many  new dynamic problem are solved [16].

 Keywords Ant colony, Ant system, TSP, ACO.