查询词典 shortest route problem

In this paper we discuss the applications of weighted graph from three aspects including the shortest path problem,Chinese postmen problem,and match problem .

本文选取了赋权图应用的三个方面进行讨论，分别是最短路问题、中国邮递员问题和匹配问题的应用。

At the same time,select three issues carries on solve by the Year 2008's ACM\ICPC finals:air condition machine is description the elbow of air conditioning installation problem,limited the quantity and types of air-conditioning pipe under the conditions of the installation of air-conditioning method;Password suspects,this problem is giving a system password letter combinations possible combinations and length under the conditions,to design an algorithm to calculate the correct arrangement of the password;Steam roller,this problem giving the situation of urban streets,drive steam roller from one point to another point of the shortest path,is used by how many time.

同时，选取了2008年度ACM\ICPC总决赛的三道题目进行求解：空调机器这一题描述的是对空调管的安装问题，在限定空调管数量和型号的条件下空调管可能的安装方法；密码嫌疑这一题求解的是在给定一个系统密码的可能的字母组合和长度的条件下，设计一个算法以算出正确的密码的排列方式；蒸汽压路机这一题是在给出城市道路情况的条件下，求两点间压路机走完最短路径总共所花费多少时间的问题。

Image segmentation based on the graph concept is analyzed in our thesis, a boundary finding problem is formulated as a shortest-path problem in a graph, then a watershed algorithm based ort image foresting transfonn is introduced, which is a unified and efficient approach for simplifying image processing problems to a minimum-cost path forest problem .

将图的概念应用于图像分割的研究中，把边界发现问题归结为图中的最短路径问题，从而引入了一种基于图像森林化变换(Image Foresting Transform，该方法是把图像处理问题简化为在图中求解最短路径森林问题的一种统一有效的方法)的分水岭算法，并分析了平滑滤波、梯度阈值在图像分割中的作用。

The paper analyses material transportation problem and give the solvable methods; analyses delivery vehicle route problem, and then construct its corresponding mathematical model and present a heuristic algorithm based on C—W algorithm; analyses the optimum scheduling problem of trucks, and then construct its corresponding mathematical model and put forward a new algorithm; analyses the Postal Transportation Problem which will perhaps be used in supply chain of manufacturing system, and then construct its corresponding mathematical model and present an approximation algorithm.

分析了制造系统供应链中供需平衡、供需不平衡、有转运等各种情况下的物资调运问题，给出了求解方法；分析了制造系统供应链配送作业中的配送车辆路线问题，建立了相应的数学模型，提出了一种基于C-W算法的启发式算法，该算法较好地解决了有时间约束的配送问题；分析了制造系统供应链中的货运卡车优化调度问题，建立了相应的数学模型，提出了一种基于表上作业法的求解算法；分析了制造系统供应链中有潜在利用价值的邮政运输方式问题，在详细描述了该问题的基础上，建立了相应的数学模型，提出了一种近似求解算法，该算法较好地解决了邮政运输方式这样的多种物流、多种运输方式，有严格时限和众多外部约束的特大型、复杂、并行的交连系统的计划调度问题。

A novel hybrid algorithm, which combines predictor-corrector primal-dual interior point method and genetic algorithm, is presented for dynamic and static reactive optimization in this dissertation. The algorithm fully make use of the advantage of interior point method in solving successive optimization problem and the advantage of genetic algorithm in solving discrete optimization problem. The original problem is divided into three parts: total successive problem, discrete problem and successive problem.

结合内点法和遗传算法，本文提出了一种新颖的混合算法用于求解动、静态无功优化问题，算法充分利用了内点法易于求解连续优化问题和遗传算法易于求解离散优化问题的优势，将原优化问题分解为初步的连续优化问题、离散变量优化问题、连续变量优化问题这三个子问题分别求解。

After a further analysis based on the empirical results,a trial probe on the cognitiveprocessing mechanism of the problem representation of the word problem in two types of MLDwas made by the author.The MRD performed much poorer than the MLD only in the mostdifficult equation listing of word problem and the medium and most difficult problemrepresentation of word problem,which showed no difference in computation and comprehensionof simple meaning of the problem,but the gap between two types of MLD became wide as afunction of difficulty and cognitive loading.It indicated that the MLD only had some advantage over MRD for they used more cognitive skills to solve the problem.

基于以上实验的结果，对两类数学困难小学生的应用题问题表征的认知机制作如下推断：混合型数学困难学生仅在高难度水平的应用题列式成绩和中高难度水平应用题问题表征水平上比单纯型数学困难学生得分显著低下，表明两类数学困难小学生在计算能力与理解简单题意的能力上并无差异，但随着难度提高，认知负荷加重，两类数学困难学生在应用题解题上的差异得以突显，表明当需要运用更多的认知能力解决问题时，单纯型数学困难学生比混合型困难学生更具优势。

When the connection is direct, the traffic flows by the shortest route possible and you are getting the best possible connection quality both in terms of the bandwidth and the latency.

当连接是直接的，交通流的最短路径可能和你得到最佳的品质方面，无论在的带宽和55.5%。

The innovation points of this paper are:(1) The traditional FCM algorithm uses the Euclidean distance for calculating the distance of two data points, but in the visual principle FCM clustering algorithm we used the number of edges of average shortest route instead.

本文的创新点在于：(1)传统的FCM算法中计算两点之间的距离采用的是欧氏距离，而本文提出的视觉原理的FCM聚类算法采用的是复杂网络中常用的两点之间的最短距离。

What is the best route to follow in order to visit as many place in the shortest possible time?

要能在最短的时间里，访问最多的地方，最好的路线是什么呢？

Now that his audience is ready to capitulate, can you show Jocko the shortest possible route to clamber from window to window with his little tin cup to collect his dues, rest ing at last on his master's shoulder?

请你说出，他的那只叫乔科的猴子，将采取怎样一条最短的路线，带着一只锡碗从一个窗子爬到另一个窗子去向人家收钱？

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。