掃描法在VRP問題中的應(yīng)用研究
發(fā)布時間：2019-04-27 10:49
【摘要】：隨著物流業(yè)的迅速發(fā)展及信息一體化的介入,配送環(huán)節(jié)在整個物流系統(tǒng)的競爭中占據(jù)著決定性的作用。運輸費用占據(jù)著物流費用的很大比例,設(shè)計合理有效的配送方案是降低物流費用的關(guān)鍵點[1]。對車輛科學的使用和調(diào)度可以縮短行駛路徑、節(jié)約物流作業(yè)的時間、降低物流運作的成本,同時提高物流系統(tǒng)的管理效率、增強客戶對物流環(huán)節(jié)的滿意度[2]。因此,車輛路徑問題(Vehicle Routing Problem,VRP)自從1959年被提出以來,一直成為熱點研究領(lǐng)域[3]。目前在大規(guī)模VRP求解上還有很多問題值得探討,為了使算法具有簡單性有效性,本文以大規(guī)模單車場VRP和大規(guī)模多車場VRP為兩類研究對象,針對在解決此類問題時算法較復(fù)雜的問題,對掃描法在VRP中的應(yīng)用和改進展開研究。主要工作如下:1.為了解決包含大規(guī)模需求點的VRP中多個配送中心的選址問題,本文基于優(yōu)化的思想,將掃描法應(yīng)用在選址問題中提出了二次重心法,建立了一種數(shù)學模型,并用算例進行算法的仿真,驗證了本文算法的有效性。2.針對大規(guī)模單車場和大規(guī)模多車場VRP中需求點覆蓋區(qū)域過大的問題,本文以降低問題規(guī)模為階段性目標,同時加入“需求點分布”這一考慮因素,設(shè)計了一種劃分區(qū)域的環(huán)形分區(qū)法,并根據(jù)這種分區(qū)思路給出幾組具體參數(shù)的舉例。3.針對單車場VRP問題,本文結(jié)合環(huán)形分區(qū)法,對掃描法在單車場VRP中的應(yīng)用進行了改進,提出了一種新算法,并用算例進行算法的仿真,對比了新算法與傳統(tǒng)掃描法的路程結(jié)果,驗證了本文算法的有效性。4.針對多車場VRP問題,建立了一種數(shù)學模型,分別針對非開放型VRP和開放型VRP問題設(shè)計了兩種掃描法應(yīng)用在此類問題中的兩階段算法,并對比了新算法與傳統(tǒng)兩階段算法的路程結(jié)果,驗證了本文算法的有效性。
[Abstract]:With the rapid development of logistics industry and the involvement of information integration, distribution plays a decisive role in the competition of the whole logistics system. Transportation cost accounts for a large proportion of logistics costs. Designing a reasonable and effective distribution scheme is the key point to reduce logistics costs [1]. The use and scheduling of vehicle science can shorten the driving path, save the time of logistics operation, reduce the cost of logistics operation, at the same time improve the management efficiency of logistics system and enhance the customer's satisfaction with logistics [2]. Therefore, vehicle routing problem (Vehicle Routing Problem,VRP) has been a hot research field since it was proposed in 1959. At present, there are still many problems to be discussed in solving large-scale VRP. In order to make the algorithm simple and effective, this paper takes large-scale single-yard VRP and large-scale multi-depot VRP as two kinds of research objects. In view of the complexity of the algorithm in solving this problem, the application and improvement of scanning method in VRP are studied. The main work is as follows: 1. In order to solve the location problem of multiple distribution centers in VRP with large-scale demand points, based on the idea of optimization, this paper puts forward the secondary center of gravity method and establishes a mathematical model based on the scan method, which is applied to the location problem. A numerical example is used to simulate the algorithm, and the validity of the proposed algorithm is verified. 2. In order to solve the problem of large coverage area of demand point in large-scale single-depot and large-scale multi-depot VRP, this paper takes reducing the problem scale as the stage goal and adding the consideration of "demand point distribution" at the same time. In this paper, a circular partition method for dividing regions is designed, and some examples of some specific parameters are given according to this idea. In order to solve the VRP problem of single vehicle yard, this paper improves the application of scanning method in VRP of single vehicle yard, and presents a new algorithm, and simulates the algorithm with an example, and compares the distance result between the new algorithm and the traditional scanning method, and makes a comparison between the new algorithm and the traditional scanning method, and makes a comparison between the new algorithm and the traditional scanning method. The validity of the proposed algorithm is verified. 4. In this paper, a mathematical model for the multi-depot VRP problem is established, and two-stage algorithms for the non-open VRP problem and the open-type VRP problem are designed, respectively, which are applied to this kind of problem. The results of the new algorithm and the traditional two-stage algorithm are compared to verify the effectiveness of the proposed algorithm.
【學位授予單位】：延安大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：F259.2;TP301.6
本文編號：2466915
[Abstract]:With the rapid development of logistics industry and the involvement of information integration, distribution plays a decisive role in the competition of the whole logistics system. Transportation cost accounts for a large proportion of logistics costs. Designing a reasonable and effective distribution scheme is the key point to reduce logistics costs [1]. The use and scheduling of vehicle science can shorten the driving path, save the time of logistics operation, reduce the cost of logistics operation, at the same time improve the management efficiency of logistics system and enhance the customer's satisfaction with logistics [2]. Therefore, vehicle routing problem (Vehicle Routing Problem,VRP) has been a hot research field since it was proposed in 1959. At present, there are still many problems to be discussed in solving large-scale VRP. In order to make the algorithm simple and effective, this paper takes large-scale single-yard VRP and large-scale multi-depot VRP as two kinds of research objects. In view of the complexity of the algorithm in solving this problem, the application and improvement of scanning method in VRP are studied. The main work is as follows: 1. In order to solve the location problem of multiple distribution centers in VRP with large-scale demand points, based on the idea of optimization, this paper puts forward the secondary center of gravity method and establishes a mathematical model based on the scan method, which is applied to the location problem. A numerical example is used to simulate the algorithm, and the validity of the proposed algorithm is verified. 2. In order to solve the problem of large coverage area of demand point in large-scale single-depot and large-scale multi-depot VRP, this paper takes reducing the problem scale as the stage goal and adding the consideration of "demand point distribution" at the same time. In this paper, a circular partition method for dividing regions is designed, and some examples of some specific parameters are given according to this idea. In order to solve the VRP problem of single vehicle yard, this paper improves the application of scanning method in VRP of single vehicle yard, and presents a new algorithm, and simulates the algorithm with an example, and compares the distance result between the new algorithm and the traditional scanning method, and makes a comparison between the new algorithm and the traditional scanning method, and makes a comparison between the new algorithm and the traditional scanning method. The validity of the proposed algorithm is verified. 4. In this paper, a mathematical model for the multi-depot VRP problem is established, and two-stage algorithms for the non-open VRP problem and the open-type VRP problem are designed, respectively, which are applied to this kind of problem. The results of the new algorithm and the traditional two-stage algorithm are compared to verify the effectiveness of the proposed algorithm.
【學位授予單位】：延安大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：F259.2;TP301.6
【參考文獻】
相關(guān)期刊論文 前3條
1 嚴俊梅;馮祈善;;作業(yè)成本法在物流成本管理中的應(yīng)用[J];湖南醫(yī)科大學學報(社會科學版);2008年04期
2 張大威;;物流配送中心選址方法研究[J];現(xiàn)代商貿(mào)工業(yè);2010年16期
3 於世為;郭海湘;諸克軍;;基于GA-TS的開放式車輛路徑優(yōu)化算法及應(yīng)用[J];系統(tǒng)管理學報;2012年02期
相關(guān)碩士學位論文 前2條
1 石華t@;改進的蟻群算法在實際VRP中的應(yīng)用研究[D];山東大學;2012年
2 孫世權(quán);多配送中心車輛路徑優(yōu)化問題的研究[D];西安電子科技大學;2012年
，本文編號：2466915
本文鏈接：http://www.sikaile.net/guanlilunwen/wuliuguanlilunwen/2466915.html
最近更新
教材專著
