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.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
For induce control, it respectively USES static and dynamic shortest path algorithms to solve the relief vehicles 'and the other vehicle 'route problem.
对于诱导控制，则分别运用静态和动态最短路算法解决了救援车辆和其它单车诱导路径的确定问题。
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).
让巡检机器人走最短路径巡检所有检测点并回到初始位置，这应该是一个典型的货郎担问题。
In traffic field, people do a lot of researches on the efficiency and applications of the shortest route. Especially, the efficiency of the shortest algorithm is a attractive problem.
在交通领域中，对最短路径搜索问题的效率和应用研究较多，尤其最短路径搜索算法的效率是人们普遍关注的重点。
In this way, they effectively solved the "traveling salesman problem," which involves finding the shortest route that allows a traveling salesman to call at all the locations he has to visit.
这样，它们有效地解决了“旅行推销员问题”，即如果一个旅行推销员需访问多个地点，如何找到访问这些地点的最短路线。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
And in the transportation network of the shortest route between two cities in is a typical example of the shortest path problem.
而在交通路网中两个城市之间的最短行车路线就是最短路径问题的一个典型例子。
And in the transportation network of the shortest route between two cities in is a typical example of the shortest path problem.
而在交通路网中两个城市之间的最短行车路线就是最短路径问题的一个典型例子。
应用推荐