最短路徑方法 的英文怎麼說

中文拼音 [zuìduǎnlùjìngfāngfǎ]
最短路徑方法 英文
k shortest path method
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） 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 （方形; 方體） square 2 [數學] （乘方） involution; power 3 （方向） direction 4 （方面） ...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  • 方法 : method; means; way; technique; process; procedure; plan; device; recipe; fashion; tool; maneuver
  1. Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )

    本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  2. After knowing fully the present situation of business operation of the golden cereal company and development characteristics in logistic - system field, the mathematics model of logistics system has been established in the article with the application of linear program method in operational research, as well as the strategy of minimum route in graph theory and the thought of transiting all over ; meanwhile, on the foundation of internet network technology and structure of b / s, the online optimization design and production of web page have been carried out for the logistic - system of the golden grain farming capital company with adoption of jsp ( java server page ) technology and sql server database technology

    本文在充分了解金色谷農資公司的業務運行現狀和物流配送行業發展特點的基礎上，應用運籌學的線形規劃方法，以及圖論中最短路徑的策略和圖的遍歷的思想，建立了配送系統數學模型；並基於internet網路技術b s結構基礎上，採用jsp （ javaserverpage ）技術和sqlserver數據庫技術，對金色谷農資公司物流配送系統進行了網上優化設計及網頁製作，研製開發了金色谷農資智能配送網。
  3. As existing approaches for computer aided conceptual design hardly take into consideration the consistency of input and output energy objects in their detailed features during the synthesis process, a heuristic approach for conceptual design of energy transforming systems was proposed based on the gene model of energy - transforming systems and the knowledge of the shortest paths between different physical objects

    摘要針對目前的概念設計方法在考慮多種能量對象細節特徵匹配性方面的不足，以能量轉換產品基因模型為基礎，提出了一種基於相異物理量間最短路徑知識的啟發式搜索求解模型。
  4. The application of the shortest path in land grading

    最短路徑方法在土地定級中的應用
  5. The soccer robot system is a dynamic environment with multiple obstacles. it is a problem of high complexity to perform path planning in such environments. the traditional methods are not efficient in such complex environments. in this paper, a self - learning method of robot navigation is proposed based on the reinforcement learning method and artificial potential field method

    本論文將增強式學習演算法和人工勢場法相結合，提出狀態評價函數和勢場的對應關系，以及控制策略和勢場力方向的對應關系，通過機器人的自適應學習，來形成優化的人工勢場，使機器人能夠以最短路徑繞過障礙，到達目標。
  6. The dijkstra algorithm of the least of hops is used for path calculated in olsr. but the protocol only tries its best to transmit data, not considering the state of wireless link

    它採用dijkstra演算法計算跳數最短路徑，並盡力而為地傳送數據包，沒有考慮無線鏈路時延、帶寬等狀態和節點擁塞程度，這樣的路徑計算方式已經不能滿足用戶對網路提供服務質量的要求。
  7. 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 ）求解大型、稀疏的方程組來反演近地表的速度場。
  8. 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

    文中應用空間內插技術實現了人口數據空間分佈化，將人口數據通過空間插值分佈於研究區域內，使人口空間分佈更接近實際；應用公交最短路徑演算法及空間相互作用模型實現了基於步行和公交出行的超市可達性，將交通對超市選址的影響定量化，方便了方案的比選；在綜合考慮人口空間分佈、超市交通可達性、現有零售商業競爭態勢的基礎上，基於拉、漢購物模式實現了超市商圈定量分析。
  9. Standard shortest path algorithms ( such as the dijkstra algorithm ) are not valid, since travel times are random, time - dependent variables. especially, the recognition version of the stochastic shortest path problems is np - complete. k expected shortest paths problem shown in this paper is one of these problems

    傳統的最短路徑方法不能解決這種非線性路徑耗費的路徑問題，尤其是同時具有隨機性和時間依賴性的網路使得最優路徑問題成為np完全問題，本文研究的k期望最短路徑就是這樣的問題之一。
  10. An efficient method of computing the shortest path algorithm which is based on dijkstra algorithm is presented ; 4

    對經典dijkstra最短路徑搜索演算法採用空間換時間的方法，提高了搜索效率； 4
  11. E. w. dijkstra. 1959. a note on two problems on conneion with graphs. numer. math. 1, 395 - 412

    陳慧琪，時間相依最短路徑問題演算方法之研究，國立交通大學運輸工程與管理學系碩士論文， 2000年。
  12. L. fu. 2001. an adaptive routing for in - vehicle route guidance system with real - time information, transportation research part b, 35, 749 - 765

    陳慧琪，時間相依最短路徑問題演算方法之研究，國立交通大學運輸工程與管理學系碩士論文， 2000年。
  13. 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 ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。
  14. It first shows the building of stochastic, time - dependent network model, the description of k expected shortest paths problem, the demonstration of travel time probability distributions for the arcs in transportation area, and the calculation of expected travel time on path

    本文首先給出了隨機時間依賴網路模型（ stdn模型） 、 k期望最短路徑問題的形式化描述，並針對交通應用領域推導出弧耗費服從的概率密度函數，路徑期望值的計算方法。
  15. A source routing framework is proposed to route traffic flows proactively over multiple paths, which tries to optimize routes for long - lived flows based on dispersity routing ; based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. long - lived flows are detected and migrated to the shortest path if their qos could be guaranteed there. suggesting non - disjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated

    提出一種以業務量內在特性為基礎的前攝式多路路由演算法：以對業務量的內在特性分析為基礎，該方法在多路發送數據流的同時檢測非最短路徑上的長流，而後在保證服務質量的前提下將長流遷移到最短路徑上傳輸；前攝式多路路由使用以路徑質量評價為基礎的業務流分佈方法有效提高網路吞吐量，通過周期性的路徑質量評價適應時變網路狀況；模擬實驗表明，該方法可以有效提高「盡力而為」方式下的網路服務質量和資源利用率；浙江大學博士學位論文3
  16. 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

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  17. 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個目標進行處理，使模型可以利用最短路演算法進行求解。
  18. One is the " belt persistence ", which is defined as the total length of joints teace length in a 1m wide belt projected to a basic line ( eliminating the overlay section ) over the length of the basic line. another is the one called as " search persistence ", which is defined a as the total length of joints trace length on the searched potential slipe surface over the length of the slip surface. thus, the author establishes a measuring and calculation system to these definitions and finishes a great deal of field investigation aiming at the joints trace length and the " rock bridge " survey

    在此基礎上，針對a區邊坡的穩定性，結合邊坡的破壞失穩模式，以邊坡節理巖體的連通特性的研究為突破點，從節理巖體的幾何參數的統計分析出發，採用monte - carlo隨機模擬原理形成節理網路模擬圖，以巖橋和節理組合破壞的內在機制為依據，以搜索節理巖橋組合的最短路徑為手段，通過帶寬投影法與路徑搜索法兩種方法的計算，獲得了sn向中緩節理的連通率分別為48 . 7和56 . 78 ，最終推薦60的連通率進行了邊坡的穩定性分析與計算，並結合工程實際，計算了邊坡的推力與錨固力，最終為邊坡的支護設計提供優化建議。
  19. Shortest path problem with turn penalties and prohibitions and its solutions

    帶轉向延誤和限制的最短路徑問題及其求解方法
  20. The smooth translation of running and walking is realized using this method. ( 3 ) a preliminary study on path planning in virtual environment is made, and two ones that are the shortest path and hypothesis - test methods are adopted to realize the function

    （ 3 ）對虛擬環境中的路徑規劃問題作了初步研究，給出了兩種有效的路徑規劃方法：最短路徑方法和ht方法，並且初步實現了虛擬戰場環境中的虛擬人路徑規劃。
分享友人
分享到 Line

分享到臉書