本文利用最短路算法修订了图上作业法，得到了两个拟多项式算法。
In this paper, we revise the graphical method by means of the Shortest path algorithm, and obtain two variants which are pseudo-polynomial algorithms.
提出了一种基于最短路算法和最小节点电压法的配电网络重构方法。
The paper proposes one method of distribution network reconfiguration based on shortest path algorithm and minimum node voltage algorithm.
对于诱导控制，则分别运用静态和动态最短路算法解决了救援车辆和其它单车诱导路径的确定问题。
For induce control, it respectively USES static and dynamic shortest path algorithms to solve the relief vehicles 'and the other vehicle 'route problem.
借助于一个简单的网络模型，本文介绍了GA的使用例子，并将GA与最短路算法及热土豆算法的性能作了比较。
With the help of a network model, this paper also introduces an example using the GA, and compares these with performances of the shortest - path and h...
借助于一个简单的网络模型，本文介绍了GA的使用例子，并将GA与最短路算法及热土豆算法的性能作了比较。
With the help of a network model, this paper also introduces an example using the GA, and compares these with performances of the shortest - path and Hot Potato al...
在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。
Based on the shortest path problem and classical absolute center model, an algorithm of absolute center problem is discussed, by using the least distance matrix and the optimum path matrix.
运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。
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.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.
文摘：给出了一种基于等高线求解坡度约束下曲面上两点间最短路径的搜索算法。
Abstract: a path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
在一般有向图中最短路问题是没有好算法的。
There is no good algorithm for finding shortcut in the directed digraph.
最短路径算法是计算机科学与地理信息科学领域的研究热点，而标号算法则是最短路径算法中的重要一族。
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.
为此，提出了线路相关集的概念和基于最短路径算法的线路相关集搜索方法，给出了线路相关因子的求解办法。
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.
为了求解上述模型，首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。
To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.
同时，根据所建立的矢量数据结构，我们研究了一些空间分析算法，如最短路径算法等。
With the vector data structure created, we study a lot of spatial analyze arithmetic, such as the shortest path arithmetic.
目前绝大多数公交查询算法是基于最短路径查找算法的改进，但最短路径算法本质上不适合公交线路的查询。
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.
该算法是最短路径完全适应性算法，使用基于软件的死锁恢复机制来检测和解除死锁；
Minimal adaptive routing is adopted and software-based recovery mechanism is used to detect and resolve deadlocks in both algorithms.
本文提出一种特殊最短路径算法，即在有向无环网络中最小时间路径算法的一种实现。
This paper proposes a reusable minimum-time path algorithm for the solution to a special time-dependent network, directed acyclic network.
讨论了一个带权图的最短路径的算法及其若干个变形问题的算法，并在MATLAB软件环境下对最短路径问题给出了一个简捷易懂的程序。
This paper discusses algorithms of the shortest path in a weighted graph as well as the shortest path transformations resulted from it, and gives a simple program solving problem of MATLAB.
计算最短路径与矩阵乘法和弗洛伊德·沃肖尔算法对以下图。
Compute shortest paths with matrix multiplication and the Floyd-Warshall algorithm for the following graph.
路由选择采用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.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
在分析城市道路网络最短路径算法和地理信息系统（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.
蚁群算法是受自然界蚂蚁觅食过程中，基于信息素的最短路径搜索食物行为启发，提出的一种智能优化算法。
Ant Colony Algorithm (ACA) is an intelligence-optimized algorithm coming from the illumination of food-seeking behavior by ants based on the shortest route of daumone.
揭示了无负回路网络的性质，并给出了这种网络最短路长度的一种算法。
This paper gives a character of the network with no negative cycles, and an algorithm for the shortest path lengths in the network as well.
最短路径算法是智能车辆路径规划问题的核心内容。
The shortest path algorithm is an important content in research of intelligent vehicle path planning.
为了保证实用性，公交车网络的最短路径算法以转车次数最少为首要目的。
To prove the practicability, the algorithm of the shortest path in bus net aims to the least of number of changing.
为了保证实用性，公交车网络的最短路径算法以转车次数最少为首要目的。
To prove the practicability, the algorithm of the shortest path in bus net aims to the least of number of changing.
应用推荐