作 者: ;
机构地区: 华南理工大学工商管理学院
出 处: 《华南理工大学学报(自然科学版)》 1997年第8期142-147,共6页
摘 要: 本文在已有研究的基础上,首先对TSP作更细致的分类,然后通过改变基于排序原理的TSP原算法中某些初始条件和计算步骤,衍生出一种用于求解随机遍历非完全有向图类型的TSP算法,使本项研究所提出的算法在应用范围方面得到进一步推广。 On the basis of the series research on this topic,an approach to classify TSP into more types is presented in the paper.Then by changing the initial condition of the algorithm which is based on the principle of sorting as mentioned in the author's previous publications,an algorithm for solving noncomplete digraphic TSP with random ergodic character is derived.Thus the applicable region of the original algorithm is extended in advance.