Ant colony algorithm with division-cooperation of labor and weight
分工合作的加权蚁群算法

For ant colony algorithm had a long searching time and was easy to fall in local optimal, this paper proposed a new kind of improvement algorithm: ant colony algorithm with division-cooperation of labor and weight. This new algorithm adopted a mode of division-cooperation of labor, and added weights in the initialization of pheromone and the rate of state transfer respectively. At the same time, it made sort-weight to the update of pheromone with the concept of sort in the genetic algorithm. Furthermore, limited the maximal pheromone. At last, used TSP to testify the validity of the new algorithm. The result proves the improved algorithm enhances the convergence largely and effectively avoid getting into local optimal easily.