An Improved Ant Colony Algorithm for Traveling Salesman Problems

An improved ant colony system algorithm was proposed for traveling salesman problems(TSPs).In the process of phenomenon update,by using a method of combination of local phenomenon update and global dynamic phenomenon update,the distribution of phenomenon was dynamicly adjusted on the current optimal route.In the process of local research,the method of 2-opt was only used for partial salesmen with shorter tours,enhancing the convergence speed.The simulation results demonstrate the proposed algorithm works well and efficient.