摘要
应用路径代数原理,通过引入途经数组等,给出一种TSP的新解法。并借助实例的求解过程讨论了算法的图意义。最后还对算法的复杂性进行了分析。
On the principle of path-algebra and introducing in lengthening matrix, passing array,open-closed flag and non-circuit minimal path matrix,etc.,a new solution to TSP is developed with its solving process presented by an instance. Its heuristic graphic meaning and the complexity of algorithm are also discussed. travelling salesman problem, Hamilton circuit, path algebra, computational complexity.
基金
国家高技术基金
自然科学基金
