One famous example is the travelling salesman problem-finding the shortestroute between several cities.
其中一个著名的例子就是推销员旅行问题:找出几个城市之间的最短路线。
2
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 'routeproblem.