k shortest path 中文意思是什麼
k shortest path
解釋
條最短路徑-
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期望最短路徑就是這樣的問題之一。 -
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期望最短路徑問題的形式化描述，並針對交通應用領域推導出弧耗費服從的概率密度函數，路徑期望值的計算方法。 -
Simulation results show that the developed scheme performs well in terms of qos performance metrics such as the lightpath hop length and the network maximal link load. for ip over wdm networks consist of oxcs and routers, which are inter - connected by optical fibers, chapter 3 presents a novel routing and wavelength assignment algorithm based on k - shortest path
對于由大量路由器和oxc通過光纖互連而組成的ipoverwdm網路，第三章創新性地提出了將ip層矛咣層綜合考慮進行：路由選擇，並利用k ? ?最短路由對有長度限制的請求進行資源分配的演算法。 -
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路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合，在鏈路帶寬有限的約束下對網路資源進行分配，同時引入業務路由的通路保護問題的研究，實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路，根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化，研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的 -
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演算法） ，並證明了演算法的正確性。 -
This main study of paper centralizes on following aspect : 1. based on shortest path heuristic and greedy algorithms, using path similarity principle and genetic operations, provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ). 2
基於最短路徑（ sph ）和greedy演算法，使用路徑相似性原：理和遺傳演算法的變異操作，提出了尋找滿足1個或2個約束條件的多路徑啟發式演算法（稱為k - sph演算法） 。
分享友人