查询词典 shortest

This study investigated the ant groups algorithm to solve the problem of traveling salesman. The target of the article is that on the map G detect the shortest length of the Hamilton Circle, namely one pair of C n cities and only visit one of the shortest closed curve.

论文主要是研究蚁群算法来解决旅游商问题，其目标是从无向图G中寻出长度最短的Hamilton 圈，此即一条对C中n个城市访问且只访问一次的最短封闭曲线。

The symbols, the path and its length of NSP are defined and the properties of NSP are studied. The dissimilitude for shortest path of general net and NSP is indicated, and a loop in the NSP shortest path is allowed. A shortest path algorithm based on NSP is proposed. An example of finding the shortest path is presented.

在定义罚转向网络模型的符号、路径及路径长度的基础上，对所建立的罚转向网络模型的性质进行了讨论，指出了该模型中的最短路径允许具有回路，提出了求解从任一节点到其他有向弧和节点的最短路径的一个算法。

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应用设计一个基于最短路径优先算法的内部网关路由协议。

How to provide route to meet the driver's multiple psychological expectations is the key problem of navigation system. The essence of this problem is resource constrained shortest path problem, which belongs to NP-C problems and can not be solved with the traditional shortest path algorithm.

提供满足驾驶员多个心理期望的路径是导航系统该解决的关键问题，其本质是资源约束最短路径问题，属于NP难问题，无法使用传统的最短路径算法解决。

This implies the existence of a polynomially bounded algorithm to find a shortest contractible cycle, a shortest separating cycle, and shortest cycle in an embedded graph in the projective plane and answers the open problems raised by Mohar and Thomassen in the case of projective plane embedded graph.

另一方面，通过定义嵌入图的几何对偶图及其相应的嵌入系统，得到几何对偶图中的可分离圈就对应于原图中的割；反之，若几何对偶图中的割在原图中对应于一个圈，那么该圈一定可分离。

Secondly, this paper presents a quantum genetic algorithm approach to the shortest path routing problem.

其次，提出了一种新的量子编码方法来利用量子遗传算法求解最短路径（shortest path， SP）问题，并通过计算机仿真实现了算法。

Graf, without question, is the greatest women's player in history.

格拉芙，现在，毫无疑问是女子网坛历史上最伟大的选手。

If not, you will have to look around at all your important data.

如果没有，您将需要检查所有的重要数据。