The problem of sequence planning can be translated into TravelingSalesmanProblem (TSP).
序列规划问题一般转化为旅行商问题来求解。
2
We present an algorithm about TravelingSalesmanproblem through the method of Self saturated Subscript in Cycle.
通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
3
The problem in Chow expect travel around, every city is accessed once and only once, we take into account the solution to the travelingsalesmanproblem.