vrp vehicle routing problem 中文意思是什麼
vrp vehicle routing problem
解釋
車輛路徑規劃問題-
Then an instance of vehicle routing problem ( vrp ) is put forward and solved to confirm their validity
通過對蟻群演算法的改進和調整,構造出最大最小蟻群演算法,實例驗證該演算法能更快地收斂到全局最優解。 -
Afterwards, in the second phase, based on the inventory supplement plan in the first phase, this paper transforms the sub - problem in this phase into vehicle routing problem with time window constrains through the theories and methods of vrp, and solves this problem by way of genetic algorithm, to make a final complete inventory supplement and transportation plan
然後,在第二階段借用車輛路線安排問題( vrp )的理論和方法,以第一階段的庫存補充計劃為基礎,將第二階段的子問題規劃成有時間窗約束的車輛路線安排問題,利用混合遺傳演算法求解該問題,從而最終形成完西南交通大學碩士研究生學位論文第11頁一整的庫存補充和運輸計劃。 -
In this paper, first, i present a new model of vrp and a heuristic algorithm of it. then, i have proofed that on the distance constrained vrp, any polynomial time heuristic h for mv, we have kh / kv > 2 ; and i give a dynamic programming recursion heuristic of md. furthermore, i study some stochastic vehicle routing problem also
並證明了在距離約束的vrp情形下對于目標函數mv (車輛數最小) ,其任一有多項式時間的啟發式演算法h得到的車輛數目k ~ h和最優車輛數目k ~ v滿足關系k ~ h k ~ v 2 ,我們還給出了md (總距離最小)的一個動態規劃演算法。 -
Vehicle routing problem, vrp
針對目前車輛路徑問題
分享友人