本文選題：配送路徑優(yōu)化　切入點(diǎn)：車(chē)輛路徑問(wèn)題(VRP)　出處：《華東理工大學(xué)》2017年碩士論文

【摘要】：在物流配送業(yè)務(wù)中,正確合理地安排車(chē)輛的配送路徑可以有效的節(jié)約運(yùn)輸時(shí)間、增加車(chē)輛利用率、降低運(yùn)輸成本、提高企業(yè)經(jīng)濟(jì)效益和客戶服務(wù)水平。因此,配送路徑問(wèn)題受到越來(lái)越多企業(yè)的關(guān)注。本文通過(guò)分析T公司的物流配送時(shí)間不固定,配送成本高,高空載率等問(wèn)題,將其描述為帶時(shí)間窗的車(chē)輛路徑問(wèn)題,在此基礎(chǔ)上以行駛路徑最短、運(yùn)輸成本最低、配送車(chē)輛數(shù)最少和顧客滿意度最高(盡量在客戶要求的時(shí)間窗內(nèi)服務(wù))為目標(biāo),以車(chē)輛裝載容量、時(shí)間窗、車(chē)輛行駛距離等為約束條件,建立T公司的帶時(shí)間窗VRP多目標(biāo)規(guī)劃模型,運(yùn)用簡(jiǎn)單的遺傳算法對(duì)實(shí)例進(jìn)行求解并分析。同時(shí),根據(jù)實(shí)際業(yè)務(wù)的需求,在為客戶服務(wù)的初始時(shí)間設(shè)置為一個(gè)非零的整數(shù);車(chē)輛的行駛距離做限制;允許車(chē)輛的載重容量有合理的超載。最后,通過(guò)設(shè)置不同的初始服務(wù)時(shí)間及行駛的最大距離,分析它們對(duì)總成本的影響,進(jìn)而找到一個(gè)適合T公司的最優(yōu)方案。
[Abstract]:In the logistics distribution business, the correct and reasonable arrangement of the vehicle distribution route can effectively save the transportation time, increase the vehicle utilization ratio, reduce the transportation cost, improve the economic benefit of the enterprise and the level of customer service. More and more enterprises pay more and more attention to the problem of distribution path. This paper describes the problem of vehicle routing with time window by analyzing the problems such as the uncertainty of logistics distribution time, high distribution cost and high no-load rate in T Company. On this basis, the shortest path, the lowest transportation cost, the least number of vehicles and the highest customer satisfaction (as far as possible in the time window required by the customer) are taken as the targets, and the vehicle loading capacity, time window, etc. In this paper, the multi-objective programming model of VRP with time window for T Company is established, and the simple genetic algorithm is used to solve and analyze the example. At the same time, according to the demand of actual business, the model of multi-objective programming with time window is established. The initial time for customer service is set to a non-zero integer; the vehicle's travel distance is limited; the vehicle's load capacity is allowed to be reasonably overloaded. Finally, by setting different initial service times and the maximum distance to travel, This paper analyzes their influence on total cost and finds out an optimal scheme suitable for T Company.
【學(xué)位授予單位】：華東理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：F252.1

【參考文獻(xiàn)】

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

1 王雪萍;;基于節(jié)約算法的城市配送路徑優(yōu)化問(wèn)題研究[J];農(nóng)村經(jīng)濟(jì)與科技;2016年14期

2 陳玉光;陳志祥;;基于準(zhǔn)時(shí)送貨和最小耗油的配送車(chē)輛路徑問(wèn)題研究[J];中國(guó)管理科學(xué);2015年S1期

3 李進(jìn);傅培華;李修琳;張江華;朱道立;;低碳環(huán)境下的車(chē)輛路徑問(wèn)題及禁忌搜索算法研究[J];中國(guó)管理科學(xué);2015年10期

4 侯玉梅;賈震環(huán);田歆;尉芳芳;;帶軟時(shí)間窗整車(chē)物流配送路徑優(yōu)化研究[J];系統(tǒng)工程學(xué)報(bào);2015年02期

5 周欣;霍佳震;;基于循環(huán)取貨的多產(chǎn)品供應(yīng)鏈提前期波動(dòng)壓縮模型[J];系統(tǒng)管理學(xué)報(bào);2015年02期

6 辛柯俊;秦中元;;基于聚類算法和蟻群算法的物流配送路徑優(yōu)化研究[J];物流工程與管理;2014年06期

7 羅勇;陳治亞;;基于改進(jìn)遺傳算法的物流配送路徑優(yōu)化[J];系統(tǒng)工程;2012年08期

8 李相勇;田澎;;帶時(shí)間窗和隨機(jī)時(shí)間車(chē)輛路徑問(wèn)題:模型和算法[J];系統(tǒng)工程理論與實(shí)踐;2009年08期

9 丁秋雷;胡祥培;李永先;;求解有時(shí)間窗的車(chē)輛路徑問(wèn)題的混合蟻群算法[J];系統(tǒng)工程理論與實(shí)踐;2007年10期

10 李志威;張旭梅;;基于動(dòng)態(tài)掃描和螞蟻算法的物流配送網(wǎng)絡(luò)優(yōu)化研究[J];管理工程學(xué)報(bào);2006年04期

，

本文編號(hào)：1659950