路徑問題 的英文怎麼說

中文拼音 [lùjìngwèntí]
路徑問題 英文
routing problem
  • 路 : 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. The capacitated open vehicle routing problem and its tabu search algorithm

    帶裝載能力約束的開放式車輛路徑問題及其禁忌搜索演算法研究
  2. A tabu search algorithm for the capacitated open vehicle routing problem is proposed

    提出了一種用於求解帶裝載能力約束的開放式車輛路徑問題的禁忌搜索演算法。
  3. Application research of the ant algorithm to vehicle routing problem with time windows

    螞蟻演算法在帶時間窗車輛路徑問題中的應用研究
  4. A checksum failure indicates an i o path problem

    校驗和失敗指示存在i / o路徑問題。
  5. A novel two - phase genetic - annealing algorithm is proposed to solve the vehicle routing problem with time window ( mdvrptw ) and multi - constraint in multiple dispatching centers

    摘要針對多約束條件的多配送中心有時間窗車輛路徑問題，提出了一種二階段遺傳退火演算法。
  6. In this paper, we summarize the important algorithms including exact algorithms and heuristic algorithms of the cvrp and put forward two kinds of new heuristic algorithms

    本文對對稱的容量固定的車輛路徑問題的幾種主要的精確演算法以及啟發式演算法作了總結，並且給出了兩種新的啟發式演算法。
  7. Formalization and knowledge representation for vehicle routing problems

    車輛路徑問題的形式化及其知識表示方法研究
  8. Solution of the shortcut problem in graph algorithms

    圖論中最短路徑問題的解法
  9. 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

    這個主題將審視一些網流的應用並集中焦點在以下網流問題的關鍵特殊情況:最短路徑問題，最大流量問題，最少成本流量問題，和多元物品流量問題。
  10. Study on physical distribution vehicle routing problem with loader scheduling

    含裝卸工調配的物流車輛配送路徑問題的研究
  11. On the basis of analyzing the disadvantages of ant colony algorithm ( as ), max - min ant colony algorithm ( mmas ) is proposed to solve vrp

    摘要蟻群演算法能很好地解決車輛路徑問題，但演算法搜索時間長，易出現停滯現象。
  12. Contract network is used in the negotiation among agents. synthesized scheduling criteria are proposed, which includes processing time, machining cost and efficiency as well as transfer routes. optimization of dynamic scheduling is achieved by adjusting the weights of these parameters

    其構成因子將加工時間、加工成本、設備利用率及加工路徑問題考慮在內，作為資源agent計算標值的重要參數，並通過對相關權系數的調節來優化車間調度目標。
  13. The u. s. transmission format is called 8 - vsb ( for 8 - level vestigial sideband ), which is more susceptible to multipath distortion than the european system, called coded orthogonal frequency division multiplexing, or cofdm

    美國的傳送格式是八階殘邊帶（ 8 - vsb ） ，這種格式比歐洲的編碼正交分頻多工（ cofdm ）系統，更容易受到多路徑問題影響。
  14. Chaotic neural network - based solution to vehicle routing problem

    車輛路徑問題的混沌神經網路解法
  15. Research on paths between sources and flows becomes pressing and important during the development process of modern electric network

    現代電力系統快速發展過程中出現的許多亟待解決的新的難點熱點問題使得電力網路源流路徑問題的研究變得十分緊迫和重要。
  16. False path problem

    錯誤路徑問題
  17. When the arc lengths are stochastic and time - dependent, the problem becomes considerably more difficult

    由於隨機性和時間依賴性引入到網路模型中，使得最優路徑問題變得復雜化、多樣化。
  18. 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期望最短路徑就是這樣的問題之一。
  19. For necessary condition, we present a practical morse function to judge. thirdly, a problem related to parameterization singularity and forward kinematics is studied, i. e., whether there exists singularity - free path between different solutions of forward kinematics. we give a clear explanation to this problem using standard idea from differential geometry

    研究了一個與參數化奇異位形有關的問題，即並聯機構運動學正解不同解之間無奇異位形連接路徑問題，採用微分幾何的基本概念解釋了同一驅動關節對應的不同正解之間是有可能有不經過驅動奇異位形的路徑的原因。
  20. You need at least 1389 kb to copy the installation files to c : docume ~ 1 raymond locals ~ 1 temp. free some space or set the temp enviroment variable to another drive

    在另外四臺機上試過，兩臺可以正常安裝，兩臺也出現同樣情況。嘗試過刪除temp目錄下的文件，也嘗試過更改環境變量的路徑，問題依然存在。
分享友人
分享到 Line

分享到臉書