A Method of Artificial Intelegence-Human-Computer Exchange for Solving Traveling Salesman Problem
货郎担问题的人工智能--人机交换解法

In this paper, a method of artificitil intelegence-human-computor exchange is presented. The optimum path shall be selected step by step. Through comparision of many pathes selected, the approximate optimum path can be found. We give some examples and a comparision among the results sowed by this method and other methods for the CHN144t raveling salesman problem is also given. These works show that using this methocl, not only the labour and time are saved but also the more optimum results can be obtained. So the method presented is feasible and effective.