本文研究具有模糊参数的最短路径问题。
This paper is to study the shortest path problem with fuzzy parameter.
路径诱导的原型是图论中的最短路径问题。
The prototype of the routing guidance is the shortest path in graph theory problems.
对新特性网络的最短路径问题研究变得更有现实价值。
With the new features of the network, the shortest path problem has a more important value and significance.
本文针对动态随机网络最短路径问题进行了较为深入的系统研究。
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.
从而为快速求解大规模网络的最短路径问题提供了一种高效的途径。
So as to quickly solve large-scale networks the shortest path to provide an efficient way.
可能在带权图中最常遇到的问题就是，寻找两点间的最短路径问题。
Although in this situation we're interested in the cheapest fares, the graph problem is nevertheless always referred to as the shortest path problem.
最短路径问题是图论中的典型问题，在生产和生活中具有广泛的实例。
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.
通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；
GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.
最后，第十一章覆盖了特殊主题：最大化流问题、最短路径问题和多物最小消费流问题。
Finally, Chapter eleven covers the special topics of the maximal flow problem, the shortest path problem, and the multicommodity minimal cost flow problem.
因而存在一个对各种方案过程模型选择的问题，这个问题可以转化为多目标模糊最短路径问题。
There exists a problem of selecting alternative process models, which can be transformed into a problem of multi-objective fuzzy shortest path.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识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.
最后，全面阐述图的最短路径算法，提出改进算法，有效地解决了含有多条相同长度的单源点最短路径问题；
A new algorithm is proposed, which solves the shortest path in a graph with the same length of the edges.
到目前为止，所有这些研究都是针对静态最短路径问题以及不确定最短路径问题中具有模糊或随机参数的问题。
By far, all the studies are focused on the static shortest path problems and the shortest path problems with uncertain parameter such as fuzzy or random parameters.
随着社会信息的不断膨胀，最短路径问题所面临的数据量是非常庞大的，求解的计算时间和存储空间大大增加。
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.
最后回到最初的地方，这和最短路径问题有些不同，需要找出一条花费最少，或者费时最少或者满足其它条件的路径。
End up where you started. It's not quite the same as the shortest path, and figure out the way to do that that involves spending the least money. Or the least time, or something else.
在本课题中我将提出一些最短路径问题的算法以及各算法之间的比较，最后将这些算法再应用于实际问题的建模问题中。
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.
最短路径问题是网络分析中最基本的问题，它作为许多领域中选择最优问题的基础，在交通网络分析系统中占有重要地位。
As the base of optimal selection problem in many fields, computing shortest paths over a network has become an important task in many transportation and network analyses systems.
针对不确定网络，研究具有随机参数的最短路径问题，采用随机数表示路径权值的不确定性，建立有约束的期望最短路模型。
Aiming at the uncertain networks, the shortest path problem with stochastic parameters is studied and the expected value model with constraints is constructed.
由于路径规划中考虑的因素可以不同，如时间、费用、道路的容量等，最短路径问题就可以引申为最快、最低费用路径问题。
Because the different factors are considered, such as time, cost and capacity of roads, problem of the shortest path can be treated as problem of the fastest or least cost.
讨论了一个带权图的最短路径的算法及其若干个变形问题的算法，并在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.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
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.
而实现路径引导系统，关键就是解决最短路径搜索问题。
The key to complete the route guidance system is solving the problem of searching the best path.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
在计算机科学的很多领域中都会出现查找最短路径的问题。
Problems that require minimum paths through some domain appear in many different areas of computer science.
而作为汽车导航的核心部分的最短路径成为了关键问题。
The issue of shortest path as the core part of navigation , becomes one of the hot topics.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
应用推荐