Evolution Logic and Algorithm for Narrow TSP Geometric Solution
Jinbiao Wang · Jisuanji gongcheng · 2005
A defination is given based on the reference[1].The six categories boundaries weight loss are first proposed. It is pointed out that theevolution logic of the geometric solution determines the convergence of the digital solution. The time complexity of the new algorithom is O(n3).The computation example demonstrates that the quality of the solution is generally not bigger than the 1.05 times of the optimal solution publiced byTSPLIB.