Ant colony optimization (ACO) belongs to the group of Meta heuristic methods. In this project we will solve the travelling sales man problem using ant colony optimization. First of all we will have input from user that is coverage area or area in which the nodes lies. Secondly we will have number of nodes from user that will be total cities in the area specified by user. After that on basis of Euclidean distance we will calculate the initial population of our tsp problem which is to solve by aco. Here our fitness function is on basis of distance and maximum number of cities coverage. To get maximum fitness value we will optimize the initial population using ant colony optimization and will get best rot with objective of minimum distance and maximum nodes cover