條最短路徑 的英文怎麼說
中文拼音 [tiáozuìduǎnlùjìng]
條最短路徑
英文
k shortest path- 條 : Ⅰ名詞1 （細長的樹枝） twig 2 （條子） slip; strip 3 （分項目的） item; article 4 （層次; 秩序; 條...
- 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
- 短 : Ⅰ形容詞（空間、時間兩端之間的距離小） short; brief Ⅱ動詞（缺少; 欠） lack; owe Ⅲ名詞1 （缺點） we...
- 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
- 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
- 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
-
We adopt k shortest paths into routing and choose the best route in them considering link costs, links hops and the number of no - utilized wavelength in a link
路由選擇採用k條最短路徑演算法進行，備選路由集中首選最佳路由時考慮鏈路的代價，跳數和每一條鏈路上不可用波長數。Firstly, according to our study on the psychology of travelers, we build the passenger - route - select model with the purpose of " least change firstly, shortest distance secondly ", propose the question of bus route aggregation and the n shortest paths algorithm combining dijkstra algorithm and moore - pape " s chain table management technology, which is proved valid
首先在對乘客出行心理研究基礎上，提出了「以換乘次數最少為第一目標，距離最短為第二目標」的公交乘客出行路徑選擇模型和公交路徑集問題以及結合dijkstra演算法和moore ? pape演算法鏈表管理技術的n條最短路徑演算法，系統的運行結果驗證了該演算法的有效性。To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ). simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost
通過分析影響網路的鏈路負載均衡的因素，比如源-目的節點間的最大流，通過每條鏈路的最大流，源-目的節點間的路徑數目，通過每條鏈路的路徑數目，以及鏈路的剩餘容量等，提出了快捷動態路由演算法fdra和關鍵性鏈路路由演算法clra ，通過模擬，與最小跳演算法（ mha ） 、最寬最短路徑（ wsp ）演算法、最小干擾路由演算法（ mira ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。Abstract : in this article an optimization method is applied to de sign open - type distribution networks. graph theory technology is used. its mathem at ical model considers both the investment of constructing lines and the cost of o peration. the main idea is getting the structure of tree network that meets with the technical constraint conditions and at the same time make the annual cost mi nimum. the examples of simulation show that this method is fast and effective
文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構This main study of paper centralizes on following aspect : 1. based on shortest path heuristic and greedy algorithms, using path similarity principle and genetic operations, provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ). 2
基於最短路徑（ sph ）和greedy演算法，使用路徑相似性原：理和遺傳演算法的變異操作，提出了尋找滿足1個或2個約束條件的多路徑啟發式演算法（稱為k - sph演算法） 。Firstly, we introduce the aodv - qos routing algorithm, the aodv routing protocol only try to find the shortest path without concerning about the qos constrains. in aodv - qos, the network has the privilege to generate paths according to its quality, and then an application selects a path with sufficient resources to satisfy a certain delay and bandwidth requirements
本文首先分析研究了aodv - qos約束路由演算法，它將原始aodv路由選擇的最短路徑原則改為按照業務qos需求選擇路由，即在尋路過程中加入時延和帶寬約束條件，選擇滿足業務性能要求的路由。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
傳統的最短路徑演算法僅僅考慮長度這一條件，這顯然不能滿足復雜交通狀況的實際需要，因此我們引入粗集理論，利用粗集中屬性重要度的概念，綜合考慮各種條件，得到了基於粗集理論的最佳路徑選擇演算法。分享友人