查询词典 shortest path problem

The certification defines creepage distance as the shortest surface path over a solid dielectric between two galvanically isolated conductors.

这个证明规定了漏电距离为沿最短表面路径穿过固态电解质，两绝缘导体之间的距离。

Hypercube has many advantages, such as smaller diameter, simple routing algorithm, many parallel paths between any two nodes, and fault-tolerance, on the other hand that the Hypercube nodal degree increased logarithmetically to the number of nodes has limited network population. So we propose a constant nodal degree hierarchical topology to remedy the weakness of Hypercube and take advantages of Hypercube most. Given the definition of FCCN we analyse the basic properties including nodal degree , number of links , extensibility and diameter (maximum network communication delay). Also we proposed a simple and self-routing algorithm applied in FCCN. Although the self-routing algorithm is not optimal, but at more than 82% case it can get the shortest path, and the percent is larger and larger increased with network levels. By the self-routing algorithm the internodal distance is calculated to evaluate the network communication delay more clearly. The average internal distance is in order of the cubic root of the network population that is almost same as logarithmetically relation in a few thousands. FCCN is a highly scalable network due to its recursive construction.

首先在比较了基本互连网络的基础上，看到超立体网络的杰出性能，包括网络直径小、寻路算法简单且为自寻路算法、容错能力好等等，但是由于其节点度随网络的规模的增加而按对数关系增长，使得超立体网络的应用规模受到极大限制，所以为了能最大限度利用超立体网络的优点的同时弥补其节点度方面的不足，作者提出了节点度等于常数4的FCCN网络结构，来最多地利用立方体网络的优点；然后在对FCCN网络进行严格的定义后，分析了网络的节点度、链路数、延伸特性、网络的直径（决定网络的最大通讯延迟）等，并提出了适于FCCN网络的简单的自寻路算法，计算自寻路算法可得到最短路径的比例，看到在多于82％以上的情况自寻路算法都是最优的，而且比例随网络层数的增加而增加；应用所提出的自寻路算法计算了可以更加准确反映网络通讯延迟的参数—网络平均节点距离，计算得到此参数与网络大小的立方根成正比，此比例关系在网络的规模在几千节点以内与对数关系的网络几乎一样；FCCN网络是一高度可扩展结构，这是因为FCCN的递归构成方式，使得网络在增加节点时其原有的拓扑结构可以保持不变，不需对网络进行重新设计，为网络的实用扩展提供了条件；理论分析得出FCCN网络是一种高度可扩展高性能网络的结论。

This model is comprised of two parts: rehandling operation scheduling and the shortest path search.

遗传算法中引入了父代参与选择和最优个体保留两种改进策略，并对GA的编码解码设计和适应度函数设计作了重点讨论。

The outer algorithm is responsible for optimizing rehandling operation scheduling, and the inner is for searching the shortest path of rehandling operation.

该系统嵌入了箱位分配作业计划和提箱作业计划算法，建立了堆场数据库，实现了两种作业计划的连续、实时操作。

A two-layer A* heuristic algorithm with the inner A* algorithm structure embedded into the outer one was put forward and realized, the inner one was responsible for searching the shortest path and the outer one for optimizing rehandling strategy.

根据建立的数学模型，通过对问题状态空间的分析，提出并实现了内外嵌套的两层结构的启发式搜索A~*算法对问题进行求解。

A mathematical model which aims to minimize the total cost of whole pick-up operation process is established, it was a multi-phase optimization model comprised of two sub-models: rehandling operation scheduling and the shortest path searching.

建立了提箱作业优化的数学模型，该模型以提箱作业总成本最小为目标，以规则库中的作业规则为约束条件。

In the simple example I described, when terrain is only walkable or unwalkable, A* will look for the shortest, most direct path.

在我描述得简单示例中，当地形只有可行走和不可行走时，A*能找到最短，最直接得路径。

By controlling the in-degrees of different kinds of nodes, the above shortest-path algorithm is improved again, so that radial and mesh hybridizing systems can be optimized simultaneously.

6在上述方法基础上，通过控制节点出入度的方法以及对环网潮流问题加以解决，提出了开环与非开环混合的输配电系统综合优化问题的解决方法。

On the basis of several reasonable hypothesizes,the highway system design can be made through figuring out the shortest path of graph.

通过合理假设把道路系统的设计转变为网络规划中求解最短路径的问题，通过统计每个路段的最短路径通过率，得出路段的运量负担情况，从而为道路的功能和等级设计提供依据。

Of course not, is now busy time, the shortest path will be traffics.

当然不是，现在是繁忙时间，最短的路都会交通挤塞。

Yet, Edith says, there was always money in the bank.

但是Edith说，她的银行户口里面总是有钱。

We have created a series of files that resolve this problem--one for each day of the 40 days of purpose.

我们制作一系列的档案去解决这问题---一个为标竿40天中的每一天。