This paper is to study the shortest path problem with fuzzy parameter.
本文研究具有模糊参数的最短路径问题。
This paper deals with TSP by transform TSP to a special Shortest Path Problem.
本文将解决TSP问题转化为一种特殊的最短路问题。
The shortest path problem is an important and elementary content in optimum network.
最短路问题是网络最优化中重要和基本的内容。
First, I begin with the problem the shortest path problem which is one classic problem in the routing part.
首先提出最短路径方法及应用，主要分两方面进行展开：点到点最短一条路径和点到点最短多条路径。
With the new features of the network, the shortest path problem has a more important value and significance.
对新特性网络的最短路径问题研究变得更有现实价值。
The shortest path problem with two additional constraints in transition time and number of edges is NP Complete.
带时间和边数约束的双约束最短路问题是NP完备的。
The fuzzy shortest path problem on a network appears in many applications. It is significant to research into it.
模糊最短路问题在许多领域有着广泛的应用，研究这一问题具有重要意义。
In respect to the shortest path problem of the weighed direct graph, the iterative method of minimum algebra is established.
最短初等链法是求解网络图最短路问题的通用算法，它突破了以往诸算法的局限性，适用范围广，具有广阔应用前景。
The shortest path problem is a typical problem in graph theory, it has a wide range of examples in production and daily life.
最短路径问题是图论中的典型问题，在生产和生活中具有广泛的实例。
And in the transportation network of the shortest route between two cities in is a typical example of the shortest path problem.
而在交通路网中两个城市之间的最短行车路线就是最短路径问题的一个典型例子。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
Most automated navigation systems rely on computing the solution to the shortest path problem, and not the problem of finding the simplest path.
在很多情形下，我们所需要的不是到达目的地的最短路径，而是一条最简单路径，也就是容易描述、理解、记忆或者执行路线的导航指令。
Although in this situation we're interested in the cheapest fares, the graph problem is nevertheless always referred to as the shortest path problem.
可能在带权图中最常遇到的问题就是，寻找两点间的最短路径问题。
By making use of Angle function, the shortest path problem is discussed in this paper, and a mathematical model for dealing the shortest path is given.
本文利用角点函数讨论最短路线问题，给出一种处理最短路线问题的数学模型。
Finally, Chapter eleven covers the special topics of the maximal flow problem, the shortest path problem, and the multicommodity minimal cost flow problem.
最后，第十一章覆盖了特殊主题：最大化流问题、最短路径问题和多物最小消费流问题。
Aiming at the uncertain networks, the shortest path problem with stochastic parameters is studied and the expected value model with constraints is constructed.
针对不确定网络，研究具有随机参数的最短路径问题，采用随机数表示路径权值的不确定性，建立有约束的期望最短路模型。
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 complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
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.
本文针对动态随机网络最短路径问题进行了较为深入的系统研究。
Connectivity analysis, as one of the spatial analysis, is widely applied in many fields, such as the shortest path problem and the procedure analysis of the whole network and so on.
连通性分析作为空间分析的一种广泛地应用于各个领域，如最佳路径搜寻以及其它网络流程分析应用中等。
In this topic Ill suggest some algorithm and the algorithm of the shortest path problem between the comparison, finally the algorithm is applied to the modeling of the actual problem again.
在本课题中我将提出一些最短路径问题的算法以及各算法之间的比较，最后将这些算法再应用于实际问题的建模问题中。
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.
在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。
With the continuous expansion of social information, the amount of data from the shortest path problem is very large, so both the computing time and the storage space increase significantly.
随着社会信息的不断膨胀，最短路径问题所面临的数据量是非常庞大的，求解的计算时间和存储空间大大增加。
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.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识s -图最短路径算法。
Here we use the ant colony algorithm to solve the problem to find the shortest path to travel.
这里我们运用蚁群算法对问题进行求解找到最短的旅行路径。
There exists a problem of selecting alternative process models, which can be transformed into a problem of multi-objective fuzzy shortest path.
因而存在一个对各种方案过程模型选择的问题，这个问题可以转化为多目标模糊最短路径问题。
There exists a problem of selecting alternative process models, which can be transformed into a problem of multi-objective fuzzy shortest path.
因而存在一个对各种方案过程模型选择的问题，这个问题可以转化为多目标模糊最短路径问题。
应用推荐