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

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

youdao

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.

旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。

youdao

For induce control, it respectively USES static and dynamic shortest path algorithms to solve the relief vehicles 'and the other vehicle 'route problem.

对于诱导控制，则分别运用静态和动态最短路算法解决了救援车辆和其它单车诱导路径的确定问题。

youdao