最短路径算法是智能车辆路径规划问题的核心内容。
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.
尤其当搜索路径较长时，搜索效率明显优于传统最短路径算法。
Especially when a longer path is being searched, the searching efficiency is much better than the traditional algorithms for shortest path.
为了保证实用性，公交车网络的最短路径算法以转车次数最少为首要目的。
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.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
道路网络通常是大规模和复杂的网络，而一般的最短路径算法需要大量的计算时间。
Road networks are usually large scale and complicated networks. Therefore, general algorithms of shortest path are not appropriate because they require much computation time.
本文提出一种特殊最短路径算法，即在有向无环网络中最小时间路径算法的一种实现。
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;
经典的最短路径算法是交通网络分析系统的一个基本算法，在理论上已经得到了广泛深入的研究。
Classical shortest-circuit path algorithms is a basic of the transportation network analysis system, which has already got the extensive research in theoretic.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识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.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
最短路径算法是计算机科学与地理信息科学领域的研究热点，而标号算法则是最短路径算法中的重要一族。
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.
目前绝大多数公交查询算法是基于最短路径查找算法的改进，但最短路径算法本质上不适合公交线路的查询。
Most of the developed algorithms are based on the improvement to the shortest path finding algorithm, however, the algorithm is essentially unsuitable for querying transit network.
最后，全面阐述图的最短路径算法，提出改进算法，有效地解决了含有多条相同长度的单源点最短路径问题；
A new algorithm is proposed, which solves the shortest path in a graph with the same length of the edges.
为此，提出了线路相关集的概念和基于最短路径算法的线路相关集搜索方法，给出了线路相关因子的求解办法。
In this paper, a new concept RCTL (relative cluster of the transmission line) and the corresponding searching algorithm are proposed, and the method to calculate relative factor of RCTL is introduced.
用C语言实现最短路径算法中的Bellman- Ford算法，这个算法可以用来解决信号处理中的一些问题。
C language shortest path algorithm to achieve the Bellman-Ford algorithm, the algorithm can be used to solve signal processing some of the problems.
路由选择采用K条最短路径算法进行，备选路由集中首选最佳路由时考虑链路的代价、跳数和每一个链路上不可用波长数。
We adopt K shortest paths into routing and choose the best route in them considering link costs, links hops and the number of noutilized wavelength in a link.
用C语言实现最短路径算法中的Floyd - Warshall算法，这个算法可以用来解决信号处理中的一些问题。
C language shortest path algorithm of Floyd-Warshall algorithm, the algorithm can be used to solve signal processing some of the problems.
在此基础上对经典的最短路径算法作了较深入的研究和探讨，提出了改进的最短路径算法，通过实验，该算法有较好的效果。
Based on the discussion, the classical shortest route algorithm is fully studied, and improved algorithm which has better effect is presented.
该算法利用网络中所有节点的局部信息保持网络的连通性，同时，利用最短路径算法计算链接权值的大小来进行拓扑结构的调整。
The algorithm maintains network connectivity only based on locally collected information and adjusts the topology structure according to the shortest-path algorithm by calculating the link weight.
在分析城市道路网络最短路径算法和地理信息系统（GIS）特点的基础上，提出城市紧急事件发生后，应急调度中最佳路径算法。
Based on the analysis of the shortest path algorithm in urban traffic network and the characteristics of GIS, the algorithm of optimal dispatch path when emergency incident occurs is put forward.
运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。
Utilizing the shortest path algorithm in Graph Theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
Ant Colony optimization (ACO) is a new-style simulating evolution algorithm. The behavior of real ant colonies foraging for food is simulated and used for solving optimization problems.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
Ant Colony optimization (ACO) is a new-style simulating evolution algorithm. The behavior of real ant colonies foraging for food is simulated and used for solving optimization problems.
应用推荐