shortest path problem 中文意思是什麼

shortest path problem 解釋
圖論最短路
  • shortest : 最短的
  • path : path（ol ）＝pathological; pathology n （pl paths ）1 （自然踏成的）路；路徑；（馬路邊上的）人行...
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  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. 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系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。
  3. Heuristic algorithm for shortest path problem with nonlinear constraints

    非線性約束最短路問題的啟發式演算法
  4. Another constrained problem is delay and delay variation constrained multicast routing problem. sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented

    第二類是時延和時延差約束的多播路由問題，提出了以最短時延路徑為基礎的一種演算法? ? sp - dvma演算法。
  5. 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

    這個主題將審視一些網流的應用並集中焦點在以下網流問題的關鍵特殊情況:最短路徑問題，最大流量問題，最少成本流量問題，和多元物品流量問題。
  6. 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

    具體的，討論了最短路問題、旅行商問題和排程問題在旅行社線路優化中的應用；討論了最小支撐樹問題、覆蓋問題和最大流問題在旅遊景區線路優化中的運用，並在附錄中給出了詳細的電子表格解法。
  7. 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期望最短路徑就是這樣的問題之一。
  8. An approach to the shortest path problem with time - varying

    一種求解時變條件下最短路的演算法
  9. 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期望最短路徑問題的形式化描述，並針對交通應用領域推導出弧耗費服從的概率密度函數，路徑期望值的計算方法。
  10. Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, aov and aoe network

    圖的概念和實現；圖的基本操作；最小價值生成樹；最短路徑；活動網路。
  11. Passing through the construction of a special coupled neural network, which can mimic the autowaves in the pulse - coupled neural networks ( pcnns ), we present a new approach ( auto waves approach ) for solving tsp. the autowaves spread in the network, and the path which the first arrived at the end point from the start point has passed is the optimal answer to the shortest path problem

    通過構造耦合神經網路，使得由神經元點火所產生的自動波在其中傳播，最先到達目的地的波前所走過的路徑即為最短路問題的最優解，從而有效地獲得了tsp問題的最優解。
  12. 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

    最短路徑問題是網路分析中基本的問題，它作為許多領域中選擇最優問題的基礎，在交通網路分析系統中佔有重要地位。
  13. 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

    首先考察實際的網路模型，根據業務需求，引入k路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合，在鏈路帶寬有限的約束下對網路資源進行分配，同時引入業務路由的通路保護問題的研究，實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路，根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化，研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的
  14. Shortest path problem with turn penalties and prohibitions and its solutions

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

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

    演算法改進及其在動態最短路徑問題中的應用
  17. 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坐標系之間的變換，國家投影帶和地方任意投影帶的高斯投影正、反算公式，並給出了具體演算法；在一些經典的最短路徑演算法的基礎上，提出了一種dijkstra最短路徑演算法的高效率實現方法。
  18. Chaotic neural network - based approach to the shortest path problem

    基於混沌神經網路最短路問題的優化演算法
  19. This paper deals with tsp by transform tsp to a special shortest path problem

    本文將解決tsp問題轉化為一種特殊的最短路問題。
  20. Shortest path algorithm with real time traffic information in dynamic vehicle routing problem

    動態車輛路徑問題中的實時最短路徑演算法研究
分享友人
分享到 Line

分享到臉書