Chinese travelling salesman problem: description with binary tree and its solution

The Chinese Travelling Salesman Problem is very famous one of combinatorial optimization problems. This paper begins with description of the problem, proposes the new viewpoint that the problem can be expressed in a binary tree and presents its implementation procedure in detail. Based on the description with a binary tree, solution of the Chinese Travelling Salesman Problem is explained. Compared with many obtained by other methods, the better result is obtained by the way proposed in this paper.