最短路線 的英文怎麼說

中文拼音 [zuìduǎnlùxiàn]
最短路線 英文
minimal path
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） 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 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 路線 : 1. （從一地到另一地所經過的道路） route; itinerary; way; tail; line 2. （思想上、政治上或工作上所遵循的根本途徑） line
  1. We performed crosswell tomography on a real crosswell seismic line from shengli oilfield by using simultaneous iterative reconstruction technique ( sirt ) based on shortest path tree ( spt ) curved ray tracing

    摘要利用基於最短路徑樹彎曲射線追蹤的聯合迭代重建層析成像（ sirt ）技術進行井間地震層析成像，對勝利油田的一對井間實際資料進行了處理。
  2. Topics covered include : randomized computation ; data structures ( hash tables, skip lists ) ; graph algorithms ( minimum spanning trees, shortest paths, minimum cuts ) ; geometric algorithms ( convex hulls, linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms

    主題包括?隨機計算、資料結構（雜湊表、省略串列） 、圖論演演算法（最小擴張樹，最短路徑，最少切割） 、幾何演演算法（凸殼、在固定或任意維度的線性規劃） 、近似計數、平行演演算法、線上演演算法、消去隨機技術，以及演演算法的機率分析工具。
  3. 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

    然後結合中樞輻射航線網路實際應用中樞紐個數少的特點，對最短路演算法加以改進，提出了一種求解航線網路魯棒優化設計的精確演算法，得到了適用於多種可能情景的魯棒解。
  4. Main technic of giss webgiso thus function modules architecture and network topological structure are confirmed webgis system implements the basic function of electronical map, such as map zoonu pan, and the abundant query of geograph and database by using maplnfo mapxtreme for java as map server and jsp., java technico this system also can implement the routing of linesx analysing of buffer and so on0 this paper advances storage model of roads and pipelines topology data, efficiently solves the maintenace problem of network topology data of webgis and implements the shortest path algorathm based on webgis by improving it0 the system has better opening by suppling database interface of map ? the system has perfect on - line help and user forum and favorable interfaces and implementation of this system makes fundament for the further research of webgiso

    本系統利用mapinfomapxtremeforjava作為地圖服務器，採用jsp和java技術，實現了基於webgis的電子地圖的縮放、漫遊等基本功能，並具有豐富的圖文定位查詢功能；實現線路路由、緩沖區分析等輔助決策功能；構建了道路管線網路拓撲數據的存儲模型，有效地解決了基於webgis的網路拓撲數據的維護問題；對dijkstra演算法進行了一些改進，實現了基於webgis的最短路徑演算法；本系統提供了電子地圖數據庫介面，使本系統具有很好的開放性和通用性； webgis系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。
  5. 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數據庫技術，對金色谷農資公司物流配送系統進行了網上優化設計及網頁製作，研製開發了金色谷農資智能配送網。
  6. Heuristic algorithm for shortest path problem with nonlinear constraints

    非線性約束最短路問題的啟發式演算法
  7. Concretely we discuss the application of the shortest path problem, traveling salesman problerm and project management method on the touring itinerary improvement of travel agency. furthermore, we explore the use of minimum spanning tree problem, overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots. and also enclosed detailed spreadsheet solutions

    具體的，討論了最短路問題、旅行商問題和排程問題在旅行社線路優化中的應用；討論了最小支撐樹問題、覆蓋問題和最大流問題在旅遊景區線路優化中的運用，並在附錄中給出了詳細的電子表格解法。
  8. For a given muting plane, first of all, this algorithm generates the corresponding grid group by barriers and nets ' ports, establishes initialization pheromone matrix, then the algorithm will use the character of ant colony algorithm to find out the shortest muting path only if it exits

    對于給定的布線平面，該演算法首先由障礙圖形和各個線網的端點生成一個包含最短路徑的訪問點陣，建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來找到當前布線路徑上的最短路徑。
  9. 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演算法計算跳數最短路徑，並盡力而為地傳送數據包，沒有考慮無線鏈路時延、帶寬等狀態和節點擁塞程度，這樣的路徑計算方式已經不能滿足用戶對網路提供服務質量的要求。
  10. 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 ）求解大型、稀疏的方程組來反演近地表的速度場。
  11. 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期望最短路徑就是這樣的問題之一。
  12. 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

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  13. 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個目標進行處理，使模型可以利用最短路演算法進行求解。
  14. This is the shortest route from boston to new york

    這是從波士頓到紐約的最短路線。
  15. What is the shortest route from london to cambridge

    從倫敦到劍橋的最短路線怎麼走？
  16. Abstract : a path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint

    文摘:給出了一種基於等高線求解坡度約束下曲面上兩點間最短路徑的搜索演算法。
  17. 2 ) forward modeling method of refraction first - break in lateral varying velocity media. for layered media, a new forward modeling method of refraction is presented. for more complex near - surface conditions such as mountain areas, a new improved ray tracing method based on shortest path assumption is studied, it has higher accuracy and faster computing efficiency than conventional ones. the method can be used for the forward modeling of complex near - surface media

    而對于折射面起伏較大、低速層和折射層速度變化較大的復雜近地表情況，提出了一種改進的最短路徑初至波射線追蹤方法，該方法精度高，計算速度快，適用於任意二維復雜近地表介質（如山地）的初至折射波的正演計算。
  18. This really isn ' t my day. hq, give me the shortest route to their location

    今天真的不是我的日子， hq ，給我最短路線到達他們的位置。
  19. It realizes the functions of the vehicle real - time monitoring, sending and receiving sms information, the process of alarm, the optimization of shortest path and so on

    實現了車輛的實時監控管理、短消息的收發、車輛報警處理和最短路線選擇等功能。
  20. According to the general theory of relativity, the planets orbit the sun because they are taking the shortest path through the curved spacetime ( recall the tennis ball )

    根據廣義相對論，行星之所以環繞太陽是因為它們沿彎曲時空的最短路線行走（回憶網球的例子） 。
分享友人
分享到 Line

分享到臉書