1) N shortest paths
N条最短路径
1.
Algorithm and its application to N shortest paths problem;
前N条最短路径问题的算法及应用
2.
Then algorithm recursively calling the Dijkstra algorithm was designed and analyzed to obtain N shortest paths,so the op.
采用了赋权有向图来表示成品油管道工艺方案优化设计问题,若干个泵站位置候选点对应图的顶点,两顶点间管段的总费用现值对应弧的权值,通过循环调用Dijkstra算法,求解出了前N条最短路径作为最优和次优方案,以备多方案比选。
2) N-Shortest-Paths
前N条最短路径
1.
Application of Dijkstra and Dijkstra-based N-Shortest-Paths Algorithm to Intelligent Transportation Systems;
Dijkstra及基于Dijkstra的前N条最短路径算法在智能交通系统中的应用
3) N-Shortest Path
N-最短路径
4) N-shortest paths algorithm
N-最短路径算法
5) N-shortest paths method
N-最短路径方法
6) K-shortest paths
最短K条路径
1.
Algorithm for solving K-shortest paths problem in complicated network;
复杂网络中最短K条路径问题的求解算法研究
