查询词典 shortest route problem

Considering the particularity of the road network and the demand of the shortest path algorithm for the road network information, a new method of representation and storage of the road network to enhance the real-timeness of the shortest path algorithm was proposed based on the basic idea of the dual graph representation to improve the forward star structure.

考虑实际道路网络的特殊性以及最短路径算法对路网信息的要求，运用对偶图法的基本思想对前向关联边结构进行了改进，提出了一种能够提高路径优化算法实时性的路网表达方法与数据存储结构，并用Dijkstra和A*最短路径算法进行了验证。

Secondly, geodesic Gaussian basis functions are defined on the graph. A shortest path obtained by a shortest path faster algorithm is used to approximate a geodesic distance.

其次，在图上定义测地高斯基函数，并用基于最短路径快速算法得到的最短路径来逼近测地线距离。

Shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path.

最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。

Not considering the restriction of the depot s transporting ability in the existing achievement of emergency dispatch, consequently, this chapter establishes a sole-resource optimized dispatch model aimed at "the shortest dispatch time" which includes the constraint of transporting ability under time restriction firstly. Moreover, the chapter deduces the algorithm of the model by mathematical induction step by step. Secondl y, it simplifies the former model and gives a simpler sole-objective model and corresponding algorithm including the constraint of transporting ability. At last, on the basis of the improved model, this chapter discusses a two-phase programming model and a multi-objective programming model which are aimed at "the shortest dispatch time" and "the fewest number of mobilized depots" including the constraint of transporting ability under time restriction.

由于现有应急调运的研究成果中没有考虑到各物资供应点受运输能力的约束，因此本章首先建立限制期内以"应急调运时间最短"为目标且含有运输能力约束的单物资调运优化模型：并利用逐步递推法推导出具体的求解算法；然后，进一步地将此模型及算法进行简化，建立更加简单的含有运输能力约束的单目标优化模型：并且讨论其算法；最后，在改进的优化模型的基础上，讨论限制期内含有运输能力约束且以"调运时间最短"、"出动的供应点数目最少"为目标的双层规划及多目标规划的优化模型及解法。

Open Shortest Path First is a routing protocol developed for Internet Protocol networks by the Interior Gateway Protocol working group of the Internet Engineering Task Force. The working group was formed in 1988 to design an IGP based on the Shortest Path First algorithm for use in the Internet.

最短路径优先是Internet 任务工程组的一个工作组为IP网络开发的一个内部网关路由选择协议，该工作小组成立于1988年并致力于为INTERNET应用设计一个基于最短路径优先算法的内部网关路由协议。

Tabaci was the shortest (19.3 d) on hairy gourd and the longest (29.0 d) on bitter cucumber, the survival rate from egg to adult was the highest (92.85%) on cucumber and the lowest (53.08%) on bitter cucumber, the laid eggs were the most (187.4 eggs per female) on cucumber and the least (30.0 eggs per female) on bitter cucumber, and the longevity was the longest (25.2 d) on cucumber and the shortest (10.9 d) on bitter cucumber. The intrinsic rate of increase r(subscript mon cucumber, hairy gourd, bitter cucumber, and sponge gourd was 0.1453, 0.1429, 0.0616, and 0.1055, respectively.

结果表明，B型烟粉虱在节瓜上的世代发育历期最短，为19.3d，在苦瓜上的世代发育历期最长，为29.0d；世代存活率在黄瓜上最高，为92.85%，在苦瓜上最低，为53.08%；平均单雌产卵量在黄瓜上最多，为187.4粒，苦瓜上最少，为30.0粒；雌成虫寿命以在黄瓜上最长，为25.2d，在苦瓜上最短，为10.9d.B型烟粉虱在黄瓜、节瓜、苦瓜和丝瓜上的内禀增长率r(下标 m分别为0.1453、0.1429、0.0616和0.1055。

This article studies based on the shortest path city public transportation intelligence inquiry system, first aims at the city public transportation line network chart establishment mathematical model; Then research based on above mathematical model database creation method and corresponding algorithm design, with take Dijkstra algorithm as foundation, based on path shortest public transportation line inquiry algorithm, and through simple analog data confirmation algorithm validity; Finally brief introduction according to this thought design realization city public transportation intelligence inquiry system.

研究基于最短道路的城市公交智能查询系统，首先针对城市公交线路网络图建立数学模型；然后研究基于上述数学模型的数据库建立方法和相应的算法设计，和以Dijkstra算法为基础的、基于道路最短的公交线路查询算法，并通过简单模拟数据验证算法的有效性；最后简要介绍按此思想设计实现的城市公交智能查询系统。

The first is to choose any one of the impossible shortest path but it doesn't eliminate any of the impossible shortest path by passed top clusters to unpassed top cluster.The second is tha...

而Dijkstra原始算法仅在可能存在的多条最短路径中任选其中一条即可；2、Dijkstra算法的每一步骤，不仅要求路径最短，同时还要求经过的顶点最少，从而求出被原始算法忽略的所有可能存在的最短路径；结果最终可以求出带权图中一起始点到其余顶点的所有最段路径。

Reading "cask" theories feeling recently, i read a "log links theory," emotionally,"akebia theory" tells us : can be equipped with a number of buckets of water is determined by the shortest piece of dried; the other hand, not only can carry buckets of water from a number of the shortest piece of dried decision, but also by the gap between the board to decide.

读&木桶理论&有感近日，我读了&木通理论&后深有感触，&木通理论&告诉我们：一个水桶能装多少水，是由最短的一块木片决定的；另一方面，一个水桶能装多少水不仅由最短的一片木片决定，还要由木板间的缝隙来决定。

Consequently the NN adaptive unit is added into the control loop according to the NN on-line approximate property. Lastly the chapter combines the proposed shortest path-planning method and the adaptive tracking method in order to stabilize the NWMR about a posture through the shortest path. Many simulations are carried out on MATLAB and the simulation results are very feasible and reasonable. Chapter 5 proposes a new localization method for the WMR running on inclined planes based on fusion of clinometric and an odometric data by Kalman filter.

本文首先求得了在斜面上运行的NWMR动力学系统的状态方程；接着选择了适当形式的系统输出方程，采用非线性系统解耦方法对该系统实现了输入—输出线性化，并应用线性系统方法进行镇定；然后提出了基于人工神经网在线逼进NWMR动力学特性的自适应跟踪控制方法；最后将本文最短距离路径规划方法与跟踪控制方法相结合实现了NWMR系统状态镇定，并通过仿真实验证明了该方法的有效性。

A carrier gas such as nitrogen is directed through line 20 and valve 22 to connect with line 26 and mix with the gas sample.

如氮气之类的载体通过管线20和阀22引入，与管线26相通，与气体样品混合。

But for the most part, knaves and parasites had the command of his fortune

然而支配他的家产的大多是恶棍和寄生虫。