最短路徑問題 的英文怎麼說

中文拼音 [zuìduǎnlùjìngwèntí]
最短路徑問題 英文
shortest route problem
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） 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 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. Unfortunately, the problem of finding multicast routing with qos constrained is a np - complete problem. so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra

    然而研究表明，由於qos組播路由帶有多個qos約束參數，因此qos組播路由問題是一個np完全問題，這使得它與傳統的路由過程不同，難以用經典的最短路徑優先演算法求解。
  2. Solution of the shortcut problem in graph algorithms

    圖論中最短路徑問題的解法
  3. This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi - commodity flow problem

    這個主題將審視一些網流的應用並集中焦點在以下網流問題的關鍵特殊情況:最短路徑問題，最大流量問題，最少成本流量問題，和多元物品流量問題。
  4. 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期望最短路徑就是這樣的問題之一。
  5. E. w. dijkstra. 1959. a note on two problems on conneion with graphs. numer. math. 1, 395 - 412

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

    陳慧琪，時間相依最短路徑問題演算方法之研究，國立交通大學運輸工程與管理學系碩士論文， 2000年。
  7. 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期望最短路徑問題的形式化描述，並針對交通應用領域推導出弧耗費服從的概率密度函數，路徑期望值的計算方法。
  8. 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

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  9. Choosing route for passengers is the key technology in the bus information system. there are many classic algorithms such as dijkstra algorithm and floyd algorithm to solve the problem. but they do n ' t fit for this problem

    選擇路徑是公交信息系統中的關鍵技術，有很多經典的演算法解決最短路徑問題，如dijkstra演算法和floyd演算法，但大都不適合於公交查詢最短路徑。
  10. Shortest path problem is one of the primary problems of network analyses. as the base of optimal selection problem in many fields, computing shortest paths over a network has become an important task in many transportation and network analyses systems

    最短路徑問題是網路分析中基本的問題，它作為許多領域中選擇最優問題的基礎，在交通網路分析系統中佔有重要地位。
  11. In the course of the design of trajectory optimization, we adopt the improved adaptive genetic algorithm. first, the route planning problem is converted into the restricted short - cut problem and dijkstra algorithm is used to get the rough optimized trajectory which makes terrain avoidance and threat avoidance effectively. then, the adaptive genetic algorithm is used to optimize the reference trajectory

    對于航跡優化問題，採用了改進自適應遺傳演算法，首先把航跡規劃問題轉化為受約束的最短路徑問題，並採用狄克斯特拉演算法得到可以進行地形迴避和威脅迴避的粗略優化路徑，然後利用改進的自適應遺傳演算法對粗略優化路徑進行優化，得到優化航跡。
  12. Shortest path problem with turn penalties and prohibitions and its solutions

    帶轉向延誤和限制的最短路徑問題及其求解方法
  13. Finally, chapter eleven covers the special topics of the maximal flow problem, the shortest path problem, and the multicommodity minimal cost flow problem

    最後，第十一章覆蓋了特殊主題：最大化流問題、最短路徑問題和多物最小消費流問題。
  14. Improvement of a algorithm and its application in shortest path problem in dynamic networks

    演算法改進及其在動態最短路徑問題中的應用
  15. Next, this paper presents the theoretical foundation of k expected shortest path, which justifie s the algorithm ( k - esp, k - pfsd algorithm ), based on a weaker stochastic consistency condition and stochastic dominance

    基於隨機一致性假設和隨機優勢的概念給出了k期望最短路徑問題的理論基礎和演算法（ kesp 、 kpfsd演算法） ，並證明了演算法的正確性。
  16. Base on exist hardware and network equipment the grid computing experimental environment is constituted in this paper. the parallel dijkstra algorithm to solve the short path problem is tested in the experimental environment

    本文在介紹網格計算基本理論基礎上，在現有硬體環境下架構了globus試驗平臺，並在globus網格環境下測試了最短路徑問題的并行dijkstra演算法。
  17. So, shortest path has it ' s matter - of fact significance

    所以，最短路徑問題具有很大的實際意義。
  18. Next, in spatial analysis technology, the article emphasis on the research on shortcut analysis algorithm : according to the feature of net model in little place, the article presents the shortest route analysis in little place, designs data structure of network

    然後在空間分析技術部分重點研究了最優路徑分析的演算法：針對小地域（如深圳大學）網路模型的特點，提出了小地域最短路徑問題，設計了相應的網路數據結構，提出了帶有懸掛點的最短路徑的演算法。
  19. And among network analyse question of shortest path is the key question

    而網路分析中最基本最關鍵的問題就是最短路徑問題。
  20. This bus route sub - system provides a new thinking in the shortest path question of public transportation and it is a good reference to make further study on it

    公交線路子系統的開發對最短路徑問題應用於公交網路提供了新的思路，對其深入研究具有重要參考價值。
分享友人
分享到 Line

分享到臉書