One famous example is the travelling salesman problem-finding the shortest route between several cities.
其中一个著名的例子就是推销员旅行问题：找出几个城市之间的最短路线。
The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
The polling robot has to go past all the checking points and return to initial location along the shortest route. As you know, this is Traveling Salesman Problem (TSP).
让巡检机器人走最短路径巡检所有检测点并回到初始位置，这应该是一个典型的货郎担问题。
应用推荐