货郎担问题是组合优化中的著名问题，到目前为止它还没有一个有效算法。
The solution on The Traveling Salesman Problem which is a famous problem in the combination optimal mathematics is very profound.
让巡检机器人走最短路径巡检所有检测点并回到初始位置，这应该是一个典型的货郎担问题。
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).
让巡检机器人走最短路径巡检所有检测点并回到初始位置，这应该是一个典型的货郎担问题。
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).
应用推荐