最短路问题

For the question of material transportation in emergency situation ,the paper gives an arithmetic operators,which changes the interval number order into real number order,and gives the arithmetic of interval number shortest path.

针对紧急状态下物资调配时间为区间数问题，在经典的Dijkstra算法基础上，通过定义一个算子，把区间数序关系转换成实数序关系，对区间数进行排序，给出了区间数的最短路算法。

The dissertation describes several traffic models for VTPOS, as well as analyzes and simulates the Characters of multiplexing, immerging, shaping of traffic, especially focuses on the Self-similarity traffic's influence to the buffer overflow and queue delay at E-OS.

本文根据光网络的特点，研究了在特定网络结构下，波长转换的合理配置问题；业务量网络分布下的最短路由优化方法，多级光网络下的逻辑拓扑；网络的偏转路由调度等，并对调度性能进行了必要的分析和仿真。

In the residual moveout, I firstly describe the Viterbi algorithm based on Markov process and compound decision theory and how to solve the shortest path problem using Viterbi algorithm.

在剩余时差校正中，首先阐述了基于Markov过程和复合判定理论的Viterbi算子；阐述了如何利用Viterbi算子来处理最短路经问题。

I-1 n 2 i for the problem of shortest path amidst a fixed number of convex polyhedral obstacles.

在包含一组相互分离凸多面体的三维空间中为任意两点寻找最短路的问题是个NP问题［2］。

The shortest path approximation algorithm builds a weighted graph from the given set of scattered points using the distribution of these data points. By computing the shortest path in the weighted graph, the problem of curve reconstruction from scattered data points is transformed into that of curve reconstruction from a set of ordered data points.

最短路逼近算法首次将图论中最短路径理论引入到曲线重建中，根据散乱数据点的分布构造带权连通图，通过求解带权连通图的最短路径，将散乱数据点集的曲线重建问题转化为有序数据点集的曲线重建问题。

The proposed method can reconstruct curves from data set with arbitrary topology, such as simply connected, multiple connected and closed scattered points, keep the shape characteristic of point set well, especially in the segments with high curvature, and provide effective methods and technologies for the screw reconstrucion.

因此最短路逼近算法有效地解决了单连通、多连通和封闭的数据点集的曲线重建问题，较好地保持了数据点集的形状和走向，尤其是带尖点的数据点集的形状特征，为旋转面、螺旋面和可展曲面面的重建提供了有效方法和技术。

SAP matrix graph theory algorithm for getting the basic idea is to map the shortest path problem.

详细说明：图论算法求SAP矩阵的基本思想是图的最短路的问题。

A layered multimodal network diagram for routing purposs is built. The viable routing problem is then formulated as a generalized shortest route problem with penalty factor, aiming at minimizing the cost of the total transportation in multi- modal networks. Assumptions and detail descriptions of the model are presented. Compendious solution thought and consultable algorithms are provided.

通过构建直观的联合运输网络图，以总运输成本最少为优化目标，将多方式联合运输合理路径的选择和优化问题转化为含有超期惩罚因子的广义最短路模型，对模型的假设和数学形式做了详细的描述，并提供了简要的求解思路和参考算法。

Analyzes the pick-up operation process on the gate side of container yards for import containers, and attributes to a multi-phase optimization problem including the rehandle operation scheduling and the shortest path searching.

分析了集装箱堆场大门一侧对进口集装箱的提箱作业过程，将提箱作业优化问题归结为一个包含倒箱优化和最短路搜索两部分的多阶段决策问题。

This model is comprised of three parts: partition of allocation area, operation mode and rule match, the best slot selection.

针对集装箱堆场的提箱作业优化问题，提出了一个以作业成本最小化为目标的多阶段决策优化模型，该模型由2部分组成：倒箱优化模型和最短路搜索模型。

Chrysanthemum of 10 thousand birthday is lax to edaphic requirement, with the arenaceous qualitative loam with fecund, good drainage had better.

万寿菊对土壤要求不严，以肥沃。排水良好的砂质壤土为好。

He unstepped the mast and furled the sail and tied it.

他拔下桅杆，把帆卷起，系住。