An Ant Colony Algorithm Based on Interesting Level

摘要

An ant colony optimization algorithm with Interesting Level(IL) is presented. We couple a group of parameters with the basic ant colony approach This approach narrates the pheromone increasing style with IL, and the parameter named interesting is used to describe some path's agglomeration of ants to handle the balance between the convergent speed and the global solution searching ability. We throw the paths into different IL and the ants select their paths according to the paths' IL. At last, the viability of the approach has been tested with some typical travel salesman problems and encouraging results have been obtained.