第 29 卷總第 131 期 ·物流商壇· 收稿日期: 2005-12-22 作者簡介: 弓晉麗(1983- ), 女, 山西文水人, 長安大學汽車學院碩士研究生, 研究方向: 物流系統(tǒng), 道路運輸與樞紐規(guī)劃。 摘 要: 在物流管理學中, 研究物流配送路徑優(yōu)化問題并選取恰當?shù)呐渌吐窂? 可以加快對客戶需求的響應速度, 提高服務質量, 增強客戶對物流環(huán)節(jié)的滿意度, 降低服務商運作成本。但由于物流配送路徑優(yōu)化問題是一個 NP-hard 問題, 使用傳統(tǒng)優(yōu)化方法很難得到最優(yōu)解或滿意解。本文基于Matlab 進行了物流配送路徑優(yōu)化問題遺傳算法的編碼, 利用Matlab 強大的數(shù)值計算能力較好地解決了這個難題并進行了實例驗證, 對物流企業(yè)實現(xiàn)科學快捷的配送調度和路徑的優(yōu)化有實際意義。 關鍵詞: 物流配送; 路徑優(yōu)化; 遺傳算法; Matlab 中圖分類號: U116.2 文獻標識碼: A 文章編號: 1002-3100 (2006) 07-0103-03 Abstract: In logistics management research, studying the vehi-cle routing problem can accelerate the response speed of the customer's demand, improve the service quality, enhance cus-tomer's satisfaction index, and reduce the business service op-eration cost. However, as a NP-hard problem, VRP is hard to draw as satisfactory conclusion by using traditional optimal al-gorithm. This paper makes the genetic algorithm programme for the VRP based on the matlab. The problem is preferably settled and it is proved that this arithmetic is more efficient by an example. It may be useful for the company to manage the physical distribution scientifically and to optimize the dis-tribution routing successfully. Key words: physical distribution; routing optimizing; genetic algorithm; Matlab 物流配送路徑優(yōu)化問題遺傳算法的實現(xiàn) The Realization of Genetic Algorithm of VRP Based on the Matlab Matlab基于 /,01,2 !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! 弓晉麗, 程志敏 (長安大學, 陜西 西安 710064) GONG Jin-li, CHENG Zhi-min (Chang'an University, Xi'an 710064, China) 物流配送路徑優(yōu)化問題, 即所謂的車輛路徑問題 (Vehicle Routing

總結

以上是生活随笔為你收集整理的matlab物流配送最优路径,基于Matlab物流配送路径优化问题遗传算法的实现的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。