查询词典 shortest path problem

Finding the shortest path in a directed network is the basic problem in graph theory.

有向图中的最短路径问题是图论应用的基本问题，对很多实际问题很有指导意义。

The data in LLE are optimized using the small world algorithm, and the shortest path and the local neighbor set clustering coefficients are used as the local parameters. As a result, the problem of the embedding distortion using only local linear patch of the manifold to define neighborhood in Euclidean space is effectively solved. Three groups of standard data sets are selected to test and to compare the efficiency and robustness of SLLE and LLE.

将复杂网络算法引入到流形学习中，利用小世界算法对LLE算法进行数据优化，并以最短路径和局部集群系数作为局部优化参数，解决了数据点不规则时以欧氏空间作为邻域判别标准在构建局部超平面造成嵌入结果扭曲的难题。

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

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

The DAN algorithm could be applied to the problem of the shortest path only to analyze the recordation of the front DNA chain.

将算法推广到最短路问题的不同之处在第三步，即只需分析在表面上排在最前的DNA链的实验记录就得到最短路。

According to disadvantage of AS that the speed low of convergentiss and easily entering the stagnation,improving the AS in some aspect by the way that importing pheromone windows that the value of pheromone cannot exceed the window,only deposit the pheromone on the edge that belongs to the iteration shortest solution path,releasing additional pheromone to the edge belongs to the so-far shortest solution path,judging the situation of convergent and to reinitialize pheromone,optimizing the solutions by local search procedure at the end of every iteration,modifying the transition probability by add some problem specific parameters and so on.

本文主要运用蚁群优化算法(Ant Colony Optimization，ACO)来求解VRP。针对蚁群算法收敛性比较差，易于停滞的缺陷，通过使用信息素窗口限制、信息素的最大最小值，只更新信息素迭代中最好解，增加了精英的蚂蚁，信息素重新初始化之前先判断出汇聚情况，在每次迭代过程中加入局部的搜索进行优化，在对蚁群算法进行了优化时考虑选择概率当中加入与问题的相关参数等措施，从而使蚁群算法的收敛性得到大大提高，避免了算法的停滞现象。

Achieve the Dijkstra algorithm, the shortest path to solve the problem.

实现了Dijkstra算法，解决最短路径问题。

This paper presents a heuristic genetic algorithmic to solve shortest path routing optimization problem.

文章针对这种有时延约束的选播QoS路由问题，提出了一种改进的遗传算法以求解该问题。

Aiming at the problem, we propose a shortest path routing algorithm based transiently chaotic neural network.

论文针对这个问题，提出了一种基于暂态混沌神经网络的最短路径路由算法。

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.

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

By hybridizing planar multi-median algorithm and shortest-path genetic algorithm, an approximate algorithm for network multi-median problem is presented.

4提出了一个将平面多中位选址方法与最短路—遗传算法相结合的近似网络多中位选址优化方法。

Breath, muscle contraction of the buttocks; arch body, as far as possible to hold his head, right leg straight towards the ceiling (peg-leg knee in order to avoid muscle tension).

呼气，收缩臀部肌肉；拱起身体，尽量抬起头来，右腿伸直朝向天花板（膝微屈，以避免肌肉紧张）。

The cost of moving grain food products was unchanged from May, but year over year are up 8%.

粮食产品的运输费用与5月份相比没有变化，但却比去年同期高8％。