shortest path algorithm 中文意思是什麼

shortest path algorithm 解釋
最短路徑演算法
  • shortest : 最短的
  • path : path（ol ）＝pathological; pathology n （pl paths ）1 （自然踏成的）路；路徑；（馬路邊上的）人行...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. Domain ontology can be modeled a simple directed acyclic network, subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ), association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )

    領域本體可以模型化為一個簡單有向無環網路，概念之間的包含關系可以通過a ~ h中的（直接）前驅后繼演算法來求解，而概念之間的關聯度可以通過a ~ h中的最短路徑演算法來求解。
  2. Secondly, according to the characteristics of few hubs in the practical hub and spoke airline network, the shortest path algorithm is improved, and an exact algorithm is proposed to solve the airline network robust optimization model, with which robust solutions suitable for various possible scenarios are obtained

    然後結合中樞輻射航線網路實際應用中樞紐個數少的特點，對最短路演算法加以改進，提出了一種求解航線網路魯棒優化設計的精確演算法，得到了適用於多種可能情景的魯棒解。
  3. Heuristic algorithm for shortest path problem with nonlinear constraints

    非線性約束最短路問題的啟發式演算法
  4. Another constrained problem is delay and delay variation constrained multicast routing problem. sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented

    第二類是時延和時延差約束的多播路由問題，提出了以最短時延路徑為基礎的一種演算法? ? sp - dvma演算法。
  5. An algorithm for maze by marking shortest path with recursive backtracking

    迷宮問題的最短距離標記法遞歸求解
  6. The authors established an initial velocity model based on the first break time of the actual data, then realized the forward calculation with the improved shortest path ray tracing algorithm, and applied the improved constrained damped simultaneous iterative reconstruction technique ( cdsirt ) to solve large - scale and sparse equations for inversing the near - surface velocity field

    根據實際地震數據的初至波時間建立初始速度模型；採用改進的最短路徑射線追蹤演算法進行正演；利用改進的約束帶阻尼聯合迭代重建技術（ cdsirt ）求解大型、稀疏的方程組來反演近地表的速度場。
  7. We got the spatial distribution map of population density by spatial interpolation, in which the population data are distributed on the grids. the results of the distribution of interpolated based on gis is closed to a real population distribution. the combination of the spatial interactive models and a shortest path algorithm for public transit network is analyzed by supermarket ' s accessibility based on pedestrianism and public transit. this methods may be used to investigate potential supermarket ' s locations. the quantitative analysis about the supermarket ' s market area is realized based on trade mode of lashmanan and hansen, which mainly includes spatial distribution of population, traffic accessibility and free competition between different firms

    文中應用空間內插技術實現了人口數據空間分佈化，將人口數據通過空間插值分佈於研究區域內，使人口空間分佈更接近實際；應用公交最短路徑演算法及空間相互作用模型實現了基於步行和公交出行的超市可達性，將交通對超市選址的影響定量化，方便了方案的比選；在綜合考慮人口空間分佈、超市交通可達性、現有零售商業競爭態勢的基礎上，基於拉、漢購物模式實現了超市商圈定量分析。
  8. An efficient method of computing the shortest path algorithm which is based on dijkstra algorithm is presented ; 4

    對經典dijkstra最短路徑搜索演算法採用空間換時間的方法，提高了搜索效率； 4
  9. A model for route selection was set up by taking population risk, average consequence and total consequence as the objectives to avoid serious transportation accidents, and by using the weighted method, the model can be solved by the shortest path algorithm

    建立了綜合考慮運輸風險、平均後果和總後果的路徑選擇模型，並利用線性加權的方法對3個目標進行處理，使模型可以利用最短路演算法進行求解。
  10. We set focus on solutions which include the vector map representation of city road network, the abstraction and construction of the topological structure of network, and the efficient implementation of shortest path algorithm

    其中，重點解決了城市道路網的矢量地圖表達、網路拓撲結構的提取和構建、最短路徑演算法的高效實現等關鍵技術。
  11. ( 2 ) utilizing the shortest path algorithm in graph theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part

    （ 2 ）運用圖論中的最短路徑搜索演算法從裝配模型中自動搜索出功能約束尺寸鏈，確定零件的功能尺寸。
  12. At last some suggestions and recommendations have been raised to develop suitable transit passenger information system for chinese cities. a gis - based passenger route choice model has been raised in this thesis. it is based on a new shortest path algorithm that uses the least transfer times as primary object and shortest path distance as second object

    最後，本文提出了發展適合我國城市的公交乘客信息系統的設想和建議，解決了公交乘客信息系統的一項關鍵技術?公交乘客出行路徑優化模型，並研究開發了唐山市公交問路系統。
  13. Then the result of certain k - shortest path algorithm is introduced as a set to be chosen by both the simulated anneal algorithm and heuristic algorithm, concerning the end - to - end traffic requirement and restriction on link bandwidth. afterwards, the effect of the value k on the outcome of the simulated anneal algorithm is researched. the network resource is allocated, while the study of link protection problem on traffic routing is introduced and two types of protection, shared protection and dedicated

    首先考察實際的網路模型，根據業務需求，引入k路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合，在鏈路帶寬有限的約束下對網路資源進行分配，同時引入業務路由的通路保護問題的研究，實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路，根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化，研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的
  14. The paper discusses the transformation problem between different types of coordinate systems, for example : the coordinate transformation between wgs - 84 coordinate system and beijing 54 coordinate system, the formula for gauss projection positive and negative computation in national stripes and any local projective stripes, and presents an algorithm. combined with some classic shortest path algorithms, this paper presents an efficient method of realize the shortest path algorithm which is based on dijkstra algorithm

    84坐標系與北京54坐標系之間的變換，國家投影帶和地方任意投影帶的高斯投影正、反算公式，並給出了具體演算法；在一些經典的最短路徑演算法的基礎上，提出了一種dijkstra最短路徑演算法的高效率實現方法。
  15. Shortest path algorithm

    最短路徑算則
  16. Shortest path algorithm with real time traffic information in dynamic vehicle routing problem

    動態車輛路徑問題中的實時最短路徑演算法研究
  17. Shortest path algorithm based on limiting parallelogram and its application in traffic networks

    平行四邊形限制最短路徑演算法及其在交通網路中的應用
  18. ( 4 ) an efficient approach of the shortest path algorithm which is based on dijkstra algorithm is realized. a motorcade - optimized dispatching software is realized. finally, future applications of the urban traffic flow guidance system are discussed

    （ 4 ）用dijkstra演算法實現了城市中兩點間最短路徑搜索，在此基礎上，實現了基於電子地圖的大型車隊優化調度及管理的系統軟體。
  19. The traditional shortest path algorithm only thinks about length, this ca n ' t satisfy requirements of the complicated traffic. so we introduce the theory of rough set. we use the concept of property importance, think about all the conditions, and get the optimal path selection algorithm based on rough set

    傳統的最短路徑演算法僅僅考慮長度這一條件，這顯然不能滿足復雜交通狀況的實際需要，因此我們引入粗集理論，利用粗集中屬性重要度的概念，綜合考慮各種條件，得到了基於粗集理論的最佳路徑選擇演算法。
  20. The example of city traffic management system in our daily lives was analyzed, and applications of shortest - path algorithm in city traffic management system were expatiatecl as well

    本文分析了城市交通管理系統在現實生活中的應用，並闡述了最短路徑演算法在城市交通管理系統中的應用。
分享友人
分享到 Line

分享到臉書