一个关于非对称距离的旅行商问题的迭代算法

An Iterative Algorithm for Non-symmetrical Traveling Salesman Problem

本文对非对称距离的旅行商问题,给出了一个迭代算法,并分析了此迭代算法的复杂度为M O(N4),其中,N是问题中旅行商所要经过的城镇数,M是两城镇间的最大距离。最后用实例对此算法进行了验算和说明。

In this paper, an iterative algorithm for nonsymmetrical traveling sal esman problem is given. Its computational complexity is M*O(N4), where N is the number of towns the salesman needs to visit and M is the maximum distance between two towns. At last,illustrative examples for the algorithm are given.