最优路径算法分析，提供了多种方案。
接下来我们提出基于调度关键路径算法。
最短路径算法是智能车辆路径规划问题的核心内容。
The shortest path algorithm is an important content in research of intelligent vehicle path planning.
迪杰斯特拉算法是目前公认的较好的最短路径算法。
The algorithm of Dijkstra is an acknowledged better algorithm of shortest route.
针对不规则的分布式网络结构，对通讯路径算法作了探讨。
To irregular topology in distributed network, algorithm about communication path is discussed.
尤其当搜索路径较长时，搜索效率明显优于传统最短路径算法。
Especially when a longer path is being searched, the searching efficiency is much better than the traditional algorithms for shortest path.
本文提出了一种有效的交通流量的经验分配方法——习惯路径算法。
This paper describes an efficient empirical traffic flow assignment method, I, e. usual route algorithm.
针对这一问题，本文提出了大区域分布式多级道路网的最优路径算法。
In order to resolve the question, the thesis put forward the optimal path algorithm in distributed multi-level road network.
交通网络分析的重点是路径分析，而路径分析的核心为最优路径算法。
Path analysis is the most important to Traffic network analysis, while optimal path algorithm is the core of path analysis.
交通网络分析的重点是路径分析，而路径分析的核心为最优路径算法。
The key point of the transportation network analysis is the way analysis, and the algorithm of the best route is the core of the way analysis.
为了保证实用性，公交车网络的最短路径算法以转车次数最少为首要目的。
To prove the practicability, the algorithm of the shortest path in bus net aims to the least of number of changing.
结果表明，加权标识s -图最短路径算法能够更有效地求解交通网络最短路径。
Experimental results show that the weighted identification S-graph shortest path algorithm for solving the transport network is an effective method for the shortest path.
最后，比较了改进算法与原有相似路径算法的差异，提出了算法需要扩展的方向。
Finally, the facts in which the algorithm needs to expand are given after comparing the difference between the improved path algorithm and the original path algorithm.
道路网络通常是大规模和复杂的网络，而一般的最短路径算法需要大量的计算时间。
Road networks are usually large scale and complicated networks. Therefore, general algorithms of shortest path are not appropriate because they require much computation time.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
本文提出一种特殊最短路径算法，即在有向无环网络中最小时间路径算法的一种实现。
This paper proposes a reusable minimum-time path algorithm for the solution to a special time-dependent network, directed acyclic network.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
同时，根据所建立的矢量数据结构，我们研究了一些空间分析算法，如最短路径算法等。
With the vector data structure created, we study a lot of spatial analyze arithmetic, such as the shortest path arithmetic.
依据网络流理论，选取最短路径算法模型，实现医疗后送最佳路径选择这一辅助决策功能。
According to the theory of flow of network, using shortest path arithmetic model, aided decision system function of best path choice was realized.
最短路径算法是图论、计算机网络、地理信息系统、交通咨询等诸多领域中研究的热门课题。
The shortest path algorithm is a hot subject in graph theory, geographical information system, and traffic advisory and so on.
综述了用网络最短路径算法求解地震射线追踪问题的原理、方法技术以及存在问题和改进措施。
The principle and method of seismic raytracing with shortest path algorithm in networks are discussed, the relevant drawbacks in which and improved measures are also analyzed.
提出计算多面体面上任意两点之间最短路径的算法：近似算法、最短路径或近似最短路径算法。
Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm;
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识s -图最短路径算法。
In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm.
经典的最短路径算法是交通网络分析系统的一个基本算法，在理论上已经得到了广泛深入的研究。
Classical shortest-circuit path algorithms is a basic of the transportation network analysis system, which has already got the extensive research in theoretic.
本文分别从算法复杂度、数据结构形式及实现的容易程度等几方面分析了三种求关键路径算法的优劣。
This text has analysed three algorithms for finding the critical paths from several respects separately, such as complexity of the algorithm, the structure form of the data and easy degree.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
以此模型为基础，利用改进的关键路径算法，得到网络化防空作战系统与目标对抗过程中的关键路径；
Combined with improved algorithm, the engagement critical path of networked Air Defense System with target was calculated.
最短路径算法是计算机科学与地理信息科学领域的研究热点，而标号算法则是最短路径算法中的重要一族。
The shortest path problem, in which label algorithms are of consequence, is a research topic in the field of geographic information science and computer science.
最短路径算法是计算机科学与地理信息科学领域的研究热点，而标号算法则是最短路径算法中的重要一族。
The shortest path problem, in which label algorithms are of consequence, is a research topic in the field of geographic information science and computer science.
应用推荐