中英
1
shortest path algorithm中文是什么意思
- 中文翻譯
- 造句
- 最短路徑算法
- 最短路徑算則
- short adj. 1.短的；短暫的。 (opp. long)。 ...
- path n. (pl. paths ) 1.(自然踏成的)路；路 ...
- algorithm n. 【數(shù)學】算法；規(guī)則系統(tǒng)；演段。
- distributed shortest path algorithm 分布式最短路徑算法; 分散式最短路徑演算法
- shortest path 最短道路; 最短通路, 最短路徑
- k shortest path 條最短路徑
- k shortest path method 最短路徑方法
- open shortest path first 近路先開協(xié)議; 開放式最短路徑優(yōu)先; 開放最短路徑優(yōu)先; 先打開最短路徑
- open shortest path firstprotocol 優(yōu)先開放最短路徑
- pair-shortest path 對偶最短通路
- rsreduced shortest path 簡約的最短通路
- shortest path assignment 最短路徑分配
- shortest path first 最短路徑優(yōu)先
- shortest path horizontal 最短刀軌
- shortest path problem 圖論最短路; 最短道路問題; 最短路徑; 最短通路問題
- shortest path routing 最短路徑選擇; 最短途徑路由選擇
- shortest path tree 最短路徑樹
- shortest-path routing 最短路徑路由選擇
- sph shortest path heuristic 最短路徑推斷
- open shortest path firest protocol 開放式最短路徑優(yōu)先協(xié)議
- open shortest path first (ospf) 開放最短路徑優(yōu)先（協(xié)議）
- ospf open shortest path first 開放式最短通路優(yōu)先（協(xié)議）; 開放最短路徑優(yōu)先路由協(xié)議
- shortest path first protocol spfp 最短路徑優(yōu)先協(xié)議
- critical path algorithm 關(guān)鍵路徑算法; 臨界通路算法
- heuristic path algorithm 啟發(fā)式路徑算法; 試探插入算法; 試探通路算法
- 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
然后結(jié)合中樞輻射航線網(wǎng)絡(luò)實際應(yīng)用中樞紐個數(shù)少的特點，對最短路算法加以改進，提出了一種求解航線網(wǎng)絡(luò)魯棒優(yōu)化設(shè)計的精確算法，得到了適用于多種可能情景的魯棒解。 - 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
首先考察實際的網(wǎng)絡(luò)模型,根據(jù)業(yè)務(wù)需求,引入k路由算法的結(jié)果作為模擬退火算法和啟發(fā)性算法備選路由集合,在鏈路帶寬有限的約束下對網(wǎng)絡(luò)資源進行分配,同時引入業(yè)務(wù)路由的通路保護問題的研究,實現(xiàn)了共享保護和專用保護兩種通路保護方式;針對全波長轉(zhuǎn)換網(wǎng)絡(luò)和無波長轉(zhuǎn)換能力網(wǎng)絡(luò),根據(jù)為所有連接請求所分配的總資源最少和滿足請求的業(yè)務(wù)數(shù)目最多兩種優(yōu)化目標對資源分配進行優(yōu)化,研究了備選路由集大小對模擬退火算法結(jié)果的影響;對模擬退火算法與啟發(fā)性算法的 - This dissertation gives series introductions to its includes the configuration and the key technology , discusses the theory of atis in detail first , then discusses the chinese atis configuration and related technology . at last , it gives an approach to the city transportation information query system which includes the function , basic constitutes , electronic map making and available method , and discusses the shortest path algorithm deeply
本論文簡要地論述了its的基本組成及其關(guān)鍵技術(shù)，詳細地探討了先進的交通信息的基本理論，研究并提出了適合中國交通實際的交通信息系統(tǒng)的基本框架，交通信息所關(guān)聯(lián)的基本技術(shù)以及推進我國城市交通信息化的對策和措施。 - 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
最后，本文提出了發(fā)展適合我國城市的公交乘客信息系統(tǒng)的設(shè)想和建議，解決了公交乘客信息系統(tǒng)的一項關(guān)鍵技術(shù)?公交乘客出行路徑優(yōu)化模型，并研究開發(fā)了唐山市公交問路系統(tǒng)。 - Fifthly , from the aspect of spatial location relationship with urban transportation network feature , the practical shortest path algorithm by studying a new greedy search strategy is gotten , which is determined by the maximum degree that combined by the current node , its nearest node and destination node
在地理信息系統(tǒng)（ geographicinformationsystem ， gis ）技術(shù)迅速發(fā)展的條件下，在gis研究的基礎(chǔ)上研究其在配網(wǎng)運行中配網(wǎng)最佳搶修路徑的算法，有助于提高配網(wǎng)供電的可靠性。 - 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
傳統(tǒng)的最短路徑方法不能解決這種非線性路徑耗費的路徑問題，尤其是同時具有隨機性和時間依賴性的網(wǎng)絡(luò)使得最優(yōu)路徑問題成為np完全問題，本文研究的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
首先在對乘客出行心理研究基礎(chǔ)上，提出了“以換乘次數(shù)最少為第一目標，距離最短為第二目標”的公交乘客出行路徑選擇模型和公交路徑集問題以及結(jié)合dijkstra算法和moore ? pape算法鏈表管理技術(shù)的n條最短路徑算法，系統(tǒng)的運行結(jié)果驗證了該算法的有效性。 - ( 2 ) ole automatic technology and oop ( object - oriented programming ) method ( 3 ) the design of the traffic management ( 4 ) the process of electronic map ' s making the shortest path algorithms is a formed aspect of route planning , but the study of shortest - path based on map is still the central of research , and the achievement of short - path based on mapinfo which is most accepted desktop geographic information system in the world is still fewer
（ 3 ）交通管理系統(tǒng)的系統(tǒng)設(shè)計。 （ 4 ）電子地圖的制作與維護。最短路研究的算法是路徑規(guī)劃中的一個研究較成熟的方面，但基于交通地圖的實際應(yīng)用研究方興未艾，特別是基于mapinfo這一備受歡迎的桌面地圖系統(tǒng)的研究還很少見。 - 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
文中應(yīng)用空間內(nèi)插技術(shù)實現(xiàn)了人口數(shù)據(jù)空間分布化，將人口數(shù)據(jù)通過空間插值分布于研究區(qū)域內(nèi)，使人口空間分布更接近實際；應(yīng)用公交最短路徑算法及空間相互作用模型實現(xiàn)了基于步行和公交出行的超市可達性，將交通對超市選址的影響定量化，方便了方案的比選；在綜合考慮人口空間分布、超市交通可達性、現(xiàn)有零售商業(yè)競爭態(tài)勢的基礎(chǔ)上，基于拉、漢購物模式實現(xiàn)了超市商圈定量分析。 - 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坐標系之間的變換，國家投影帶和地方任意投影帶的高斯投影正、反算公式，并給出了具體算法；在一些經(jīng)典的最短路徑算法的基礎(chǔ)上，提出了一種dijkstra最短路徑算法的高效率實現(xiàn)方法。
- 更多例句： 1 2
- shortest path algorithmとは意味：最短経路｛さいたん けいろ｝アルゴリズム
- 推薦英語閱讀
shortest path algorithm的中文翻譯，shortest path algorithm是什么意思，怎么用漢語翻譯shortest path algorithm，shortest path algorithm的中文意思，shortest path algorithm的中文，shortest path algorithm in Chinese，shortest path algorithm的中文，shortest path algorithm怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權(quán)所有違者必究。
關(guān)于我們
