The Optimal Solution to the Matrix Type of TSP
Hao Zhi · Jisuanji yingyong yanjiu · 2003
This paper aim at a special type of planner TSP, the arrangement of all cities in this type like a Matrix,the distance between two cities in each row(or each column) is equal.We obtain the optimal algorithms and their prove for the following two conditions:row spacing equaling col width and one case of row spacing not equaling col width.For the other case of row spacing not equaling col width,we provide three algorithms and their comparison.