摘要
针对K-TSP(K-personTravelingSalesmanProblem)问题,该文提出了一种利用蚁群算法求解该问题的新思路。该算法采用k只蚂蚁共同构造问题的一个解,并通过多组(每组k只)蚂蚁相互协作最终达到搜索最优解的目的。实验结果显示,该算法行之有效,是一种求解K-TSP问题的有效算法。
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.
出处
《计算机仿真》
CSCD
2004年第12期162-164,共3页
Computer Simulation
