Ant System (AAS), using the properties of basic Adaptive Filters. Here, we have exploited the
properties of Least Mean Square (LMS) algorithm for the pheromone updation to find out the
best minimum tour for the Travelling Salesman Problem (TSP). TSP library has been used
for the selection of benchmark problem and the proposed AAS determines the minimum tour
length for the problems containing large number of cities. Our algorithm shows effective …