对于诱导控制，则分别运用静态和动态最短路算法解决了救援车辆和其它单车诱导路径的确定问题。
For induce control, it respectively USES static and dynamic shortest path algorithms to solve the relief vehicles 'and the other vehicle 'route problem.
针对多数无线传感器网络路由协议不能高效应对网络拓扑结构动态变化的问题，本文提出了一种基于最短路径的层次路由协议TVHRP。
As many routing protocols for wireless sensor network can't handle dynamic topological variation efficiently, a new hierarchical routing protocol (TVHRP) based on the shortest path is proposed.
本文针对动态随机网络最短路径问题进行了较为深入的系统研究。
Furthermore, the study of the shortest path problem in dynamic and stochastic networks (DSNs) not only has important practical value, but also has high theoretical significance.
通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；
GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.
通过供应链节点间的柔性度大小不同用动态规划中最短路问题来寻找供应链风险在供应链上传导的关键路径。
Then it employs the shortest path model of dynamic programming to identify the key path of risk transmission along the supply chain on the basis of different inter-nodal flexibility.
通过供应链节点间的柔性度大小不同用动态规划中最短路问题来寻找供应链风险在供应链上传导的关键路径。
Then it employs the shortest path model of dynamic programming to identify the key path of risk transmission along the supply chain on the basis of different inter-nodal flexibility.
应用推荐