Optimize the best route algorithm, so that path query more quickly and accurately.
优化了最佳线路算法，使路径查询更加快速准确。
This paper describes an efficient empirical traffic flow assignment method, I, e. usual route algorithm.
本文提出了一种有效的交通流量的经验分配方法——习惯路径算法。
The results show that the algorithm is excellent and superior to the other current typical route algorithms.
结果表明，该算法各方面性能良好，并且优于目前几种典型路由算法。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
Based on the discussion, the classical shortest route algorithm is fully studied, and improved algorithm which has better effect is presented.
在此基础上对经典的最短路径算法作了较深入的研究和探讨，提出了改进的最短路径算法，通过实验，该算法有较好的效果。
Three algorithms: Information Query Algorithm, DIRA( Dynamic Information Route Algorithm), IRH Route Exchange Algorithm of the Boundary Area were proposed.
提出并实现了信息检索算法，动态信息路由交换算法DI RA和边界域IRH的路由交换算法；
In this article, the author analyses on the static state algorithm (including default route algorithm) and the basic dynamic route algorithm in the network layer.
本文就路由选择算法中的默认路由(含静态路由)和两种简单的动态路由算法作一简单分析。
The algorithm can recognize the excellence and worseness of different processing route by trial-and-error method.
算法利用试错，区分加工路线的优劣。
The optimized algorithm of machining process about moving route and reamer choice was introduced.
并在优化刀具选择和走刀路径等方面给出了加工过程的优化算法。
It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.
当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。
From the second route diagram above, it is quite easy to formulate an algorithm to help the wombat to the leaf.
从上面的第二个路线图可以看到，描述一个算法让袋熊到达树叶是非常容易的。
The proposed EEPR algorithm stochastically controls the number of the RREQ packets using the residual energy and ETX value of a link on the path and thus facilitates energy-efficient route setup.
所提算法通过使用的剩余能量和链路路径上的ETX值，来随机控制RREQ包的数量，从而有利于节能路由的建立。
Considered the factors of link bandwidth, link delay, route hop and server load, the algorithm can balance network load and enhance the network performance to some extent.
算法考虑了链路带宽、链路时延、路由跳数、服务器负载等因素，可以在一定程度上平衡网络负载和提高网络性能。
This paper introduces the concept and character of access networks, proposes route construction and reliability algorithm used in the design, and compares the new method with the conventional method.
介绍了接入网的概念及特点，阐述了高可靠性光纤接入网设计中应用的路由构造算法和可靠性算法，比较了与传统方法的异同。
Meantime, we put forward a virtual route technique, design a load measurement algorithm and a route measurement algorithm, give a solution for the bottleneck problem of network.
其间，我们提出了虚拟路由技术，设计了负载评估和路由度量算法，并提出了对于网络瓶颈问题的解决方法。
The proper algorithm about the excellent tour route is established in this paper.
本文对于设计灾情最佳巡视路线提出了恰当的算法。
Gis system for postal logistics, route optimization algorithm introduced and contrast details of the system used by the optimization method.
对邮政物流gis系统中，路线优化的算法进行介绍和对比，详细介绍本系统采用的优化方法。
And especially discusses the optimization of distribution route with ant colony algorithm.
并重点讨论了蚁群算法对配送路线的优化。
Results and Conclusion \ the algorithm of the optimal route choice based on Comprehensive Fuzzy Judgment can provide an efficient, feasible route for travellers.
结果与结论基于模糊综合评判的最佳路径选取算法能够为驾驶员提供较合理的高效行驶路线。
The problem of dynamic route selecting by using ant colony algorithm was discussed.
论述蚁群算法在动态路径选择问题上应用。
To patrol route design problem in the patrol system of power net, a hierarchical search algorithm based on Simulated Annealing is proposed.
针对电网巡视系统中巡视路线设计的问题，提出了一种基于模拟退火思想的分层搜索算法。
According to the emulation research of existing station operation, this paper studies the optimization algorithm of route arrangement of train arrival-departure in PDL station.
在借鉴已有车站作业仿真研究的基础上，对客运专线车站的列车接发进路排列的优化算法进行研究。
Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
详细地论述了基于邻接表图形数据结构的进路搜索算法，并给出了完整的描述。
Simulation demonstrated that the algorithm could dynamic adjust the route which can make the product of packet delay and energy consumption of routing path to be minimization in AD hoc networks.
仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。
To input a reasonable route choice set containing more routes of drivers' real choices into the route choice model, a route choice set generation algorithm based on link penalty method was proposed.
为了给路径选择模型提供合理的路径集输入，使路径集能够包含更多驾驶员实际选择的路径，提出了一种基于路段惩罚法的路径集生成算法。
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.
针对现有大区域范围路径规划算法存在的一些问题，提出一种限制搜索区域的多比例尺最优路径规划算法。
This paper introduces a routing algorithm based on route profile, which distributes the available bandwidth over candidate route set, matches the distribution of QoS of incoming virtual circuits.
给出基于路由分布的路由算法，将有效带宽分散于候选路由集中，以匹配到达的虚电路请求服务质量的分布特点。
This paper introduces a routing algorithm based on route profile, which distributes the available bandwidth over candidate route set, matches the distribution of QoS of incoming virtual circuits.
给出基于路由分布的路由算法，将有效带宽分散于候选路由集中，以匹配到达的虚电路请求服务质量的分布特点。
应用推荐