Take the travelling salesman problem, for example.

比方说旅行推销员问题。

Till now, the best published result of Chinese-Travelling Salesman Problem is 15904km.

迄今为止，中国旅行商问题的最优解是15904公里。

Second, we apply all of them to 10-city travelling salesman problem (TSP), respectively.

其次将四种方法分别应用于10个城市的旅行推销商问题。

One famous example is the travelling salesman problem-finding the shortest route between several cities.

其中一个著名的例子就是推销员旅行问题：找出几个城市之间的最短路线。

This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network.

本文提出用神经网络解旅行商问题(tsp)的改进算法。