An Improved Time Adaptive Ant System

摘要

Time Adaptive Ant System (TAAS) is the new proposed algorithm with modified pheromone updation rule. Here, we have exploited the properties of Time adaptive Least Mean Square (LMS) algorithm for the pheromone updation rule to resolve the basic shortcoming of easily falling into local optima and slow convergence speed. The improved algorithm has better global search ability and good convergence speed. A block diagram representation is also proposed, which may leads to stability analysis. Our algorithm is applied to Traveling Salesman Problem (TSP), and the simulation shows the effective results, as compared to other existing approaches.