带有前序关系的旅行商问题的禁忌搜索算法

Tabu Search Heuristic Algorithm for Traveling Salesman Problem with Precedence Relations

对一种带有前序关系的旅行商问题作了研究，给出了问题的数学模型，提出了求解该问题的禁忌搜索算法．实验表明算法是有效的，求解速度快，并且该算法既适用于对称的情况，也适用于不对称的情况．

Traveling salesman problem with precedence relation is studied. Tabu search heuristic algorithms for the problem are proposal after giving the mathematical model of the problem. The experiments show that all algorithms proposed are efficient and can be suited for either symmetric,or asymmetric cases.