本文選題：城市物流　切入點(diǎn)：TDVRPTW　出處：《深圳大學(xué)》2017年碩士論文

【摘要】：車輛路徑問題(VRP,Vehicle Routing Problem)是現(xiàn)代物流管理研究中一項十分重要的問題。隨著社會和經(jīng)濟(jì)的快速發(fā)展,人們對貨物運(yùn)輸和配送的需求不斷增加,門到門物流服務(wù)的占比不斷上升,配送壓力大是負(fù)責(zé)末端物流配送的物流企業(yè)面臨的突出問題,同時由于城市居民人數(shù)的不斷增加,城市規(guī)模的不斷擴(kuò)張,交通擁堵已嚴(yán)重影響物流末端的配送效率,這是城市物流企業(yè)所面臨的又一突出問題。如何在有限的時間里,有效的調(diào)度物流運(yùn)輸車輛,通過合理的安排配送車輛的配送路徑和出行時間,在克服交通擁堵的情況下以最小的配送成本完成配送任務(wù),實現(xiàn)物流配送系統(tǒng)高效低成本的運(yùn)作,是當(dāng)今物流業(yè)亟待解決的問題。因此,研究基于動態(tài)交通網(wǎng)絡(luò)的車輛路徑問題具有十分重要的現(xiàn)實意義。根據(jù)以上背景,本文基于動態(tài)交通網(wǎng)絡(luò)對帶時間窗限制的時變條件下城市配送路徑優(yōu)化問題(TDVRPTW,Time-dependent Vehicle Routing Problem With Time Windows)進(jìn)行了相關(guān)研究。論文從城市物流配送及動態(tài)交通網(wǎng)絡(luò)的相關(guān)理論出發(fā),針對帶時間窗約束的車輛路徑規(guī)劃問題(VRPTW,Vehicle Routing Problem With Time Windows),考慮了物流配送車輛的啟用、配送的距離及配送的及時性對配送成本的影響,構(gòu)建了帶有懲罰函數(shù)的以最小配送成本為目標(biāo)的VRPTW路徑規(guī)劃模型,然后考慮動態(tài)的交通環(huán)境,將VRPTW路徑規(guī)劃模型進(jìn)行擴(kuò)充,構(gòu)建了時變環(huán)境下TDVRPTW路徑規(guī)劃模型。通過各種算法對比分析后,確定了以遺傳算法作為本文中物流配送路徑規(guī)劃模型的求解算法,設(shè)計了適用于求解問題模型的染色體編碼方式及具有遺傳進(jìn)化功能的選擇、交叉、變異等遺傳操作�；谏鲜瞿Ｐ秃蛢�(yōu)化方法,利用國際公認(rèn)的標(biāo)準(zhǔn)算例庫和深圳市真實物流配送案例進(jìn)行驗證。實驗結(jié)果表明:(1)針對非時變條件下的VRPTW模型,運(yùn)用本文所設(shè)計的遺傳算法對國際公認(rèn)的標(biāo)準(zhǔn)算例庫進(jìn)行了求解驗證,其求解結(jié)果已接近現(xiàn)有最優(yōu)解,表明了該算法的有效性與可行性;(2)動態(tài)交通網(wǎng)絡(luò)下,VRPTW模型及TDVRPTW模型運(yùn)用本文算法求得的結(jié)果進(jìn)行對比后,發(fā)現(xiàn)TDVRPTW模型結(jié)果中車輛行駛的總路程與總花費(fèi)時間在一定程度上大于VRPTW模型結(jié)果中車輛行駛的總路程與總花費(fèi)時間,證明了交通因素對物流配送產(chǎn)生了影響;(3)動態(tài)交通網(wǎng)絡(luò)環(huán)境下的物流配送更加接近于現(xiàn)實的城市物流配送。
[Abstract]:Vehicle Routing problem is a very important problem in modern logistics management.With the rapid development of society and economy, people's demand for goods transportation and distribution is increasing, and the proportion of door-to-door logistics services is increasing. Distribution pressure is a prominent problem faced by logistics enterprises in charge of terminal logistics distribution.At the same time, due to the increasing number of urban residents and the continuous expansion of urban scale, traffic congestion has seriously affected the distribution efficiency of logistics terminal, which is another outstanding problem faced by urban logistics enterprises.In the limited time, how to effectively dispatch the logistics transportation vehicles, through the reasonable arrangement of the distribution route and travel time of the distribution vehicles, in order to overcome the traffic congestion with the minimum distribution cost to complete the distribution task.It is an urgent problem for logistics industry to realize the efficient and low cost operation of logistics distribution system.Therefore, it is very important to study the vehicle routing problem based on dynamic traffic network.Based on the above background, this paper studies the time-dependent Vehicle Routing Problem With Time Time problem of urban distribution routing under time-varying conditions with time window constraints based on dynamic traffic network.Based on the related theories of urban logistics distribution and dynamic transportation network, this paper discusses the vehicle routing problem with time window constraint (VRPTW) vehicle Routing Problem With Time Windows, and considers the use of logistics distribution vehicle.Based on the influence of distance and timeliness of distribution on the cost of distribution, this paper constructs a VRPTW path planning model with penalty function, which aims at the minimum distribution cost. Then considering the dynamic traffic environment, the VRPTW path planning model is extended.The TDVRPTW path planning model in time varying environment is constructed.Through the comparison and analysis of various algorithms, the genetic algorithm is chosen as the solution algorithm of the logistics distribution path planning model in this paper, and the chromosome coding method suitable for solving the problem model and the selection and crossover with the function of genetic evolution are designed.Genetic manipulation such as variation.Based on the above model and optimization method, we use the internationally recognized standard case base and Shenzhen real logistics distribution case to verify.The experimental results show that the VRPTW model under time-invariant condition is solved by using the genetic algorithm designed in this paper to validate the internationally accepted standard example library. The results are close to the existing optimal solutions.The validity and feasibility of the algorithm are demonstrated. (2) the model of VRPTW and the model of TDVRPTW under dynamic traffic network are compared with the results obtained by the algorithm in this paper.It is found that the total distance and total cost time of the vehicle in the result of TDVRPTW model is to some extent larger than that of the total distance and total time of the vehicle in the result of VRPTW model.It is proved that transportation factors have an impact on logistics distribution.) under the dynamic traffic network environment, the logistics distribution is closer to the reality of urban logistics distribution.
【學(xué)位授予單位】：深圳大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：F252.1;TP18

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 楊凌杰;李靜;王輝;孫維維;;基于蟻群算法的配送路徑優(yōu)化系統(tǒng)研究[J];中國制造業(yè)信息化;2008年17期

2 張錦;謝克明;;蟻群算法在醫(yī)藥物品配送路徑優(yōu)化中的應(yīng)用[J];太原理工大學(xué)學(xué)報;2009年06期

3 范小寧;徐格寧;楊瑞剛;;車輛配送路徑優(yōu)化的新型蟻群算法[J];計算機(jī)工程與應(yīng)用;2011年26期

4 蘇濤;王慶斌;孫聰;李文強(qiáng);;蟻群算法的軍事物流配送路徑優(yōu)化[J];海軍航空工程學(xué)院學(xué)報;2012年03期

5 劉金雨;劉亞敏;連浩;張佳惠;王娟;;基于混沌蟻群算法的地震應(yīng)急物流配送路徑優(yōu)化問題研究[J];山西電子技術(shù);2014年02期

6 黃志剛;林鳳濤;;車間配送路徑優(yōu)化的研究[J];華東交通大學(xué)學(xué)報;2007年04期

7 林鳳濤;郭厚q;;基于蟻群算法的車間配送路徑優(yōu)化的仿真研究[J];機(jī)械設(shè)計與制造;2007年10期

8 徐麗蕊;;基于LINGO的城市物流配送路徑優(yōu)化[J];電子設(shè)計工程;2013年22期

9 王茜;;禁忌結(jié)合遺傳結(jié)果對配送路徑優(yōu)化的應(yīng)用研究[J];計算機(jī)應(yīng)用與軟件;2011年06期

10 陳曄;張勇明;趙金超;;復(fù)雜軍事物流網(wǎng)絡(luò)的配送路徑優(yōu)化研究[J];艦船電子工程;2013年02期

相關(guān)會議論文 前1條

1 張錦;謝克明;;蟻群算法在醫(yī)藥物品配送路徑優(yōu)化中的研究[A];中華醫(yī)學(xué)會醫(yī)學(xué)工程學(xué)分會第十次學(xué)術(shù)年會暨2009中華臨床醫(yī)學(xué)工程及數(shù)字醫(yī)學(xué)大會論文集[C];2009年

相關(guān)碩士學(xué)位論文 前10條

1 王仁祿;湖南CF公司藥品配送路徑優(yōu)化研究[D];昆明理工大學(xué);2015年

2 林宇肖;考慮油品隔離的成品油城市配送路徑優(yōu)化[D];大連海事大學(xué);2015年

3 陳晶晶;基于改進(jìn)蟻群算法的美食林公司農(nóng)產(chǎn)品冷鏈物流配送路徑優(yōu)化研究[D];河北科技大學(xué);2015年

4 岳美思;時變網(wǎng)絡(luò)下考慮碳懲罰率的城市配送路徑優(yōu)化模型研究[D];東北大學(xué);2013年

5 王晶;SHJAJ快運(yùn)公司配送路徑優(yōu)化研究[D];東北大學(xué);2014年

6 李波;基于動態(tài)交通網(wǎng)絡(luò)的城市物流配送路徑優(yōu)化研究[D];深圳大學(xué);2017年

7 李慧;基于蟻群算法的美特好配送路徑優(yōu)化研究[D];山西大學(xué);2011年

8 趙炳乾;基于改進(jìn)節(jié)約法的T公司車輛配送路徑優(yōu)化研究[D];河北工程大學(xué);2013年

9 李靖澤;我國成品油二次配送路徑優(yōu)化研究[D];哈爾濱理工大學(xué);2014年

10 李明澤;城市農(nóng)產(chǎn)品冷鏈物流配送路徑優(yōu)化研究[D];大連海事大學(xué);2013年

，

本文編號：1706341