Then this paper sets up a tabu search algorithm for the problem by presenting a new solution indicating method and makes some experimental computations to a transportation net with 21 nodes.

• 通过设计一种新的解的表示方法构造了求解该问题的禁忌搜索算法，并以21个节点的运输网络为例进行了实验计算。