最优路径算法分析，提供了多种方案。
针对这一问题，本文提出了大区域分布式多级道路网的最优路径算法。
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.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
但是现有的层次网络模型和最优路径算法难以扩展到时变、随机网路中，为此本文提出了网络树模型和最优路径算法。
But it is difficulty to expand the existing hierarchical network models and algorithms for finding optimal path problems in the stochastic and time-dependent network.
最后设计了最优路径选取的算法。
本文讨论了矩阵最优路径的串行和并行算法。
Discusses the sequential and parallel algorithms about matrix optimum path.
本文分析、比较了现有的几种路径搜索算法，最后采用一种比较简单的单门限算法，并通过仿真得到参数最优值。
After analyzing and comparing some path search algorithms, the paper ultimately adopted a simple single threshold algorithm and attained optimal parameters through simulation.
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the application of algorithm in the network of road.
应用表明该算法可靠高效，可用于实际受限交通网络最优路径规划。
The verification test shows that the algorithm is reliable and highly effective for optimum path planning of real constrained road networks.
而采用基于广度优先算法，在只考虑一到两次换乘的实际情况下，能有效的实现最优路径的查询。
But USES based on the breadth first algorithm, in only considered one to two time trades while the actual situation in, can the effective realization most superior way inquiry.
通过加入算法的自主学习结束条件，避免了找到最优路径后的重复学习，节省了学习时间。
Through an automatic termination condition, the redundant learning after finding optimal path is avoided and the time of learning is reduced.
仿真表明，本文算法通常都能得到全局最优路径，并且规划速度快、内存需求小，非常适合于实时应用。
Simulation results show that it generates global optimal path in most situations, and is very time and space efficient thus suitable for real time applications.
本算法特别适合于在大规模交通网络中求解任意两点间的实时多条最优路径。
This algorithm is particularly suitable for solving several real-time optimal paths between any two points in large-scale transportation network.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
Based on depth first search, the article USES route deletion and node deletion methods to produce multi-solutions, and then determine the optimum solution with least costing.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
为了选择最优路径，综合考虑出行时间、出行费用和换乘次数等因素，给出一个综合评价指数模型，并用算例对算法和模型的可行性进行验证。
In order to select optimum route, thinking about the factors which are time of transfers, cost of running and times of transfers, a compound evaluation index model is obtained.
作者提出了一种在电信网中对虚路径的带宽进行分配的步进式最优算法 。
This article presents an efficient optimal algorithm for virtual path (VP) bandwidth allocation in telecom networks.
运用该阻抗函数建立基于路径的动态用户最优路径选择变分不等式模型，给出了该模型的启发式算法。
A route-based variational inequality model and a heuristic algorithm of the dynamic user optimal route choice problem were proposed by the link travel time function.
根据传感器网络的特性，结合蚂蚁算法能够快速找出最优路径的特点，提出了一种基于偏转角的蚂蚁路由算法。
Combined the characteristic of sensor network and the properties of ant algorithm to quickly identify optimal path, an ant routing algorithm based on deflection Angle is proposed.
该文提出了基于隐马尔可夫模型局部最优状态路径的数据重建(LOPDI)算法。
This paper presents a HMM Local Optimal state Path-based Data Imputation (LOPDI) algorithm.
理论分析和试验结果证明该算法能较好的找到最优路径。
Theoretical analysis and experimental results show that the algorithm can find the optimal path.
在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。
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.
将该算法应用于交通方案优化设计，要求路径、时间、舒适安全指数三个目标能同时达到最优，通过仿真实验对优化结果进行了分析比较。
The algorithm apply to design in the transportation project, requesting route, time, comfort safety index can attain superior in the meantime, pass an experiment carry on the analysis comparison.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
针对现有大区域范围路径规划算法存在的一些问题，提出一种限制搜索区域的多比例尺最优路径规划算法。
In allusion to some problems of existing route planning algorithm of large area, a multi-scale optimal route planning algorithm within restricted searching area was proposed.
求解tsp问题是遗传算法应用的一个重要领域，其本质是TSP问题中巡回路径编码串的组合最优化问题。
Solving Traveling Salesman problem (TSP) is an important problem in Genetic Algorithm's Application, it is an optimization problem of the TSP path encoding in essence.
本文分析了GIS环境下动态路径优化算法的特点，对GIS环境下城市路网的最优路径选择问题的关键技术进行了研究和验证。
This paper analyses some characters of dynamic path optimum algorithm, studies and verifies the key techniques of the optimum path of city road network under GIS.
本文分析了GIS环境下动态路径优化算法的特点，对GIS环境下城市路网的最优路径选择问题的关键技术进行了研究和验证。
This paper analyses some characters of dynamic path optimum algorithm, studies and verifies the key techniques of the optimum path of city road network under GIS.
应用推荐