最短路问题

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

Use at the same time formic group in optimizing a method to solve map of number of urban reseau coordinate most short circuit problem .

同时采用蚁群优化方法来解决城市网格坐标数码地图中的最短路新问题。

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.

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