【摘要】：車輛路徑問題(Vehicle Routing Problem,VRP)是非確定多項式(NP)難題,它的解(路徑的選擇)對運(yùn)輸成本起著非常重要的影響,因而受到國內(nèi)外學(xué)者的重視。車輛路徑問題(VRP)是物流配送過程中的關(guān)鍵問題之一,隨著電子商務(wù)的蓬勃發(fā)展,快遞業(yè)稱為現(xiàn)代物流高度發(fā)展的結(jié)果,它囊括了物流活動的基本要素,快遞不僅以高科技的現(xiàn)代化運(yùn)輸手段傲視群雄,更以運(yùn)輸?shù)奈锲分亓枯p、體積小、附加值高、能滿足個性化需求、能滿足時限要求等特點(diǎn)使其在物流中擁有得天獨(dú)厚的位置。由于快遞業(yè)的豐厚利潤,當(dāng)今眾多傳統(tǒng)的物流企業(yè)紛紛涉足快遞行業(yè)。而合理,順暢的快遞網(wǎng)絡(luò)是快遞企業(yè)運(yùn)營的根本,快遞業(yè)的定義就是通過合理的快遞網(wǎng)絡(luò)把寄件方投寄的快件送到收件方手上,因此快遞網(wǎng)絡(luò)的路由布局也就決定著快遞企業(yè)的運(yùn)營成本、效率、服務(wù)速度、服務(wù)范圍等一系列的核心競爭力水平,具有重要的戰(zhàn)略意義。而快遞網(wǎng)絡(luò)的路由布局其中一方面就是反映在車輛的路徑安排上。合理的車輛路徑,不但能減少貨物到達(dá)客戶處的時間,降低車輛運(yùn)輸成本,改善車輛利用效率,實(shí)現(xiàn)資源的合理配置,有助于企業(yè)節(jié)約運(yùn)輸成本,而且能夠幫助快遞企業(yè)提升服務(wù)質(zhì)量,把貨物快捷準(zhǔn)時地送達(dá),讓客戶對貨物的時限性要求得到滿足,從而實(shí)現(xiàn)科學(xué)的物流管理目標(biāo)。隨著快遞行業(yè)日益激烈的競爭,對VRP的研究因此具有更加實(shí)際意義。本文在認(rèn)真研讀國內(nèi)外在VRP問題的文獻(xiàn)基礎(chǔ)上,對車輛路徑問題進(jìn)行研究分析,將車輛路徑問題應(yīng)用到快遞企業(yè)的服務(wù)中,通過優(yōu)化快遞車輛的行車路徑來降低企業(yè)的運(yùn)營成本,增大貨物派送的準(zhǔn)時性來提高快遞企業(yè)的服務(wù)水平。以A快遞公司為例,研究了A快遞公司在城市快遞網(wǎng)絡(luò)中的遞送車輛服務(wù)的路徑尋優(yōu)問題,本研究設(shè)計了兩階段算法來求解A快遞公司C站點(diǎn)的快遞車輛路徑問題。第一階段,運(yùn)用k-means快速聚類算法對C站點(diǎn)所有客戶點(diǎn)進(jìn)行路區(qū)的合理劃分,第二階段是對每一個路區(qū)內(nèi)的客戶點(diǎn)進(jìn)行車輛路徑的規(guī)劃,以最少的車輛行駛里程數(shù)為主要目標(biāo),建立車輛路徑問題的數(shù)學(xué)模型,然后運(yùn)用遺傳算法進(jìn)行求解,最后用MATLAB實(shí)現(xiàn)該算法,計算出基于遺傳算法的最優(yōu)目標(biāo)函數(shù)值與最優(yōu)車輛路徑方案,驗證了算法在解決A快遞公司C站點(diǎn)現(xiàn)存問題上的有效性。
[Abstract]:Vehicle routing problem (Vehicle Routing problem) is an uncertain polynomial (NP) problem. Its solution (path selection) plays a very important role in transportation cost, so it has been paid more attention to by scholars at home and abroad. Vehicle routing problem (VRP) is one of the key problems in the process of logistics distribution. With the rapid development of electronic commerce, express delivery industry is called the result of high development of modern logistics, which includes the basic elements of logistics activities. Express delivery not only with high-tech modern means of transportation, but also with the transport of light weight, small volume, high added value, can meet the personalized needs, can meet the requirements of the time limit and other characteristics make it have a unique position in the logistics. Due to the fat profits of express delivery industry, many traditional logistics enterprises have been involved in express delivery industry. And a reasonable and smooth express delivery network is the basis for the operation of express delivery enterprises. The definition of express delivery industry is to send the courier sent by the sender to the recipient's hand through a reasonable express delivery network. Therefore, the routing layout of express delivery network also determines the operating cost, efficiency, service speed, service scope and other core competitiveness levels of express delivery enterprises, which has important strategic significance. The routing layout of express delivery network is reflected in the routing of vehicles on one hand. A reasonable vehicle route can not only reduce the time of goods arriving at the customer, reduce the cost of vehicle transportation, improve the efficiency of vehicle utilization, realize the rational allocation of resources, but also help the enterprise to save the transportation cost. Moreover, it can help express enterprises to improve service quality, deliver goods quickly and punctually, and make customers meet the requirements of time limit of goods, thus realizing the scientific logistics management goal. With the increasingly fierce competition in express delivery industry, the research on VRP has more practical significance. On the basis of studying the literature of VRP problem at home and abroad, this paper studies and analyzes the vehicle routing problem, and applies the vehicle routing problem to the service of express delivery enterprise. By optimizing the driving path of express delivery vehicles to reduce the operating costs of enterprises and increase the punctuality of goods delivery to improve the service level of express delivery enterprises. Taking A express company as an example, this paper studies the route optimization problem of A express company's delivery vehicle service in the city express delivery network. In this study, a two-stage algorithm is designed to solve the express vehicle routing problem of A express company C site. In the first stage, the k-means fast clustering algorithm is used to reasonably divide the road area of all customer points in C station. The second stage is to plan the vehicle path for each customer point in the road area, taking the minimum vehicle mileage as the main goal. The mathematical model of the vehicle routing problem is established, and then the genetic algorithm is used to solve the problem. Finally, MATLAB is used to realize the algorithm, and the optimal objective function value and the optimal vehicle routing scheme based on the genetic algorithm are calculated. Verify the effectiveness of the algorithm in solving the existing problems of A express company C site.
【學(xué)位授予單位】：華南理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：U116.2

【相似文獻(xiàn)】

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

1 王云平;;車輛路徑問題的形式化及其知識表示方法研究[J];遼寧省交通高等�？茖W(xué)校學(xué)報;2006年04期

2 王江晴;康立山;;動態(tài)車輛路徑問題仿真器的設(shè)計與實(shí)現(xiàn)[J];核電子學(xué)與探測技術(shù);2007年05期

3 曹二保;賴明勇;張漢江;;模糊需求車輛路徑問題研究[J];系統(tǒng)工程;2007年11期

4 唐連生;梁劍;;突發(fā)事件下的車輛路徑問題研究綜述[J];鐵道運(yùn)輸與經(jīng)濟(jì);2008年12期

5 唐偉勤;張隱;張敏;;大規(guī)模突發(fā)事件應(yīng)急物資調(diào)度中的車輛路徑問題[J];物流技術(shù);2008年12期

6 劉紅梅;陳楊;;車輛路徑問題的形式化方法研究[J];科技資訊;2008年05期

7 唐加福;孔媛;潘震東;董穎;;基于劃分的蟻群算法求解貨物權(quán)重車輛路徑問題[J];控制理論與應(yīng)用;2008年04期

8 熊志華;邵春福;姚智勝;;車輛路徑問題的可靠性研究[J];物流技術(shù);2008年08期

9 徐俊杰;;利用微正則退火算法求解車輛路徑問題[J];安慶師范學(xué)院學(xué)報(自然科學(xué)版);2009年02期

10 寧曉利;;車輛路徑問題的組合優(yōu)化算法[J];物流技術(shù);2009年06期

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

1 符卓;陳斯衛(wèi);;車輛路徑問題的研究現(xiàn)狀與發(fā)展趨勢[A];中國運(yùn)籌學(xué)會第七屆學(xué)術(shù)交流會論文集（下卷）[C];2004年

2 楊世堅;陳韜;;隨機(jī)車輛路徑問題研究綜述[A];中國系統(tǒng)工程學(xué)會決策科學(xué)專業(yè)委員會第六屆學(xué)術(shù)年會論文集[C];2005年

3 李桂平;陳楠;;多中心車輛路徑問題的解決思路[A];中國地理信息系統(tǒng)協(xié)會第四次會員代表大會暨第十一屆年會論文集[C];2007年

4 李大衛(wèi);王夢光;;廣義車輛路徑問題——模型及算法[A];1997中國控制與決策學(xué)術(shù)年會論文集[C];1997年

5 符卓;聶靖;;開放式車輛路徑問題及其若干研究進(jìn)展[A];中國運(yùn)籌學(xué)會第八屆學(xué)術(shù)交流會論文集[C];2006年

6 陳寶文;宋申民;陳興林;單志眾;;應(yīng)用于車輛路徑問題的多蟻群算法[A];第25屆中國控制會議論文集（下冊）[C];2006年

7 戎麗霞;;模糊需求條件下的多車場車輛路徑問題[A];第三屆中國智能計算大會論文集[C];2009年

8 張鳳姣;張興芳;;基于不確定理論的車輛路徑問題[A];第九屆中國不確定系統(tǒng)年會、第五屆中國智能計算大會、第十三屆中國青年信息與管理學(xué)者大會論文集[C];2011年

9 肖雁;符卓;李育安;;帶軟時間窗的車輛路徑問題及其應(yīng)用前景探討[A];中國運(yùn)籌學(xué)會第六屆學(xué)術(shù)交流會論文集（下卷）[C];2000年

10 許鑫;范文慧;馮雅U，

本文編號：2167375