Application of Ant Colony Algorithm in K-person Traveling Salesman Problem

To solve the K-person Traveling Salesman Problem (K-TSP), a novel ant colony algorithm is proposed in this paper. In the algorithm, a solution of K-TSP problem is constructed by a group of ant (including k ants ) and many groups of ants cooperate to search the maximal solution. The experimental results show that the algorithm is effective for K-TSP problem.