帶時(shí)間窗的卷煙物流配送動(dòng)態(tài)車輛路徑優(yōu)化方法研究
本文選題:卷煙物流 + 動(dòng)態(tài)車輛路徑問(wèn)題; 參考:《北京交通大學(xué)》2013年碩士論文
【摘要】:近年來(lái),我國(guó)煙草行業(yè),尤其是煙草分銷領(lǐng)域的發(fā)展正面臨著國(guó)內(nèi)外雙重壓力的嚴(yán)峻形勢(shì),對(duì)外要抵御國(guó)際煙草巨頭的擴(kuò)張和滲透,對(duì)內(nèi)要與高速發(fā)展的國(guó)內(nèi)物流公司進(jìn)行激烈的市場(chǎng)競(jìng)爭(zhēng)。面對(duì)新形勢(shì),國(guó)家煙草行業(yè)做出了加快發(fā)展現(xiàn)代卷煙物流管理配送系統(tǒng)的重要指示,并將其作為提升煙草流通企業(yè)市場(chǎng)競(jìng)爭(zhēng)力的重要途徑和手段。本論文,結(jié)合參加“煙草商業(yè)企業(yè)精益物流應(yīng)用研究”課題的實(shí)際研究工作,從煙草企業(yè)卷煙物流配送的實(shí)際需求出發(fā),對(duì)帶時(shí)間窗的卷煙物流配送動(dòng)態(tài)車輛路徑優(yōu)化方法進(jìn)行了選題研究。 車輛路徑安排是卷煙物流配送的一個(gè)重要環(huán)節(jié),隨著卷煙客戶對(duì)服務(wù)交付時(shí)間的要求越來(lái)越高,實(shí)施動(dòng)態(tài)車輛配送路徑優(yōu)化就顯得尤為重要。帶時(shí)間窗的卷煙物流配送動(dòng)態(tài)車輛路徑優(yōu)化問(wèn)題,是建立以客戶需求服務(wù)為核心的卷煙物流配送動(dòng)態(tài)調(diào)度系統(tǒng)的關(guān)鍵問(wèn)題,也是發(fā)展建設(shè)現(xiàn)代卷煙物流系統(tǒng)面對(duì)的重要課題之一。該問(wèn)題研究,對(duì)實(shí)現(xiàn)卷煙物流資源動(dòng)態(tài)整合與合理配置、降低卷煙物流成本、提高煙草商業(yè)企業(yè)物流效率和客戶服務(wù)質(zhì)量等都具有重要的實(shí)際意義。 本論文,在對(duì)國(guó)內(nèi)外研究現(xiàn)狀分析的基礎(chǔ)上,結(jié)合對(duì)卷煙物流精益化配送策略的系統(tǒng)分析,建立了帶時(shí)間窗的動(dòng)態(tài)車輛路徑優(yōu)化模型,提出了采用兩階段法求解策略和改進(jìn)型遺傳算法,并通過(guò)實(shí)例驗(yàn)證了模型和算法的有效性。 本文的主要研究?jī)?nèi)容及成果包括: 1.通過(guò)對(duì)VRP問(wèn)題描述,分析了動(dòng)態(tài)車輛路徑問(wèn)題(DVRP)的定義、分類,并提出DVRP問(wèn)題為客戶需求時(shí)間不確定性引起的問(wèn)題;通過(guò)對(duì)現(xiàn)代精益物流內(nèi)涵和卷煙物流配送系統(tǒng)分析,總結(jié)歸納出了卷煙物流精益化的配送策略。 2.針對(duì)帶時(shí)間窗的動(dòng)態(tài)VRP問(wèn)題(DVRPTW),設(shè)定了關(guān)于軟時(shí)間窗的懲罰函數(shù),并建立了以懲罰成本和配送消耗成本最小為目標(biāo)函數(shù)的卷煙物流精益化配送路徑優(yōu)化模型。 3.通過(guò)分析煙草配送中心的DVRPTW工作原理,提出了“靜態(tài)初始優(yōu)化階段+動(dòng)態(tài)局部?jī)?yōu)化階段”的配送路徑模型兩階段求解策略。 4.針對(duì)一般遺傳算法容易出現(xiàn)早熟收斂等缺點(diǎn),提出了求解卷煙物流帶時(shí)間窗的動(dòng)態(tài)VRP問(wèn)題(DVRPTW)的改進(jìn)遺傳算法,包括采用動(dòng)態(tài)線性標(biāo)定方式表示適應(yīng)度函數(shù)、采用最佳個(gè)體保存與賭輪選擇相結(jié)合的選擇策略、采用適用于已有路徑改造的模擬退火法等。 5.以湖南省益陽(yáng)市煙草公司某區(qū)20個(gè)客戶為例進(jìn)行了實(shí)例分析,驗(yàn)證了所建模型的正確性和求解方法的有效性,為實(shí)際動(dòng)態(tài)車輛路徑選擇提供了決策依據(jù)。
[Abstract]:In recent years, the development of tobacco industry in China, especially in the field of tobacco distribution, is facing a severe situation of double pressure at home and abroad, so it is necessary to resist the expansion and infiltration of international tobacco giants. Domestic and high-speed development of domestic logistics companies to carry out fierce market competition. Faced with the new situation, the national tobacco industry has made important instructions to speed up the development of modern cigarette logistics management and distribution system, and regard it as an important way and means to enhance the market competitiveness of tobacco circulation enterprises. This paper, combined with the actual research work of "Application Research of Lean Logistics in Tobacco Commercial Enterprises", starts from the actual demand of cigarette logistics distribution in tobacco enterprises. The method of vehicle routing optimization for cigarette logistics distribution with time window is studied. Vehicle routing is an important part of cigarette logistics distribution. With the increasing demand of service delivery time for cigarette customers, it is particularly important to implement dynamic vehicle distribution path optimization. The dynamic vehicle routing optimization of cigarette logistics distribution with time window is a key problem in the establishment of a dynamic scheduling system of cigarette logistics distribution with customer demand service as the core. It is also one of the important subjects in the development and construction of modern cigarette logistics system. The study of this problem is of great practical significance to realize the dynamic integration and rational allocation of cigarette logistics resources, reduce the cost of cigarette logistics, and improve the efficiency of logistics and customer service quality of tobacco commercial enterprises. Based on the analysis of domestic and foreign research situation and the systematic analysis of lean distribution strategy of cigarette logistics, a dynamic vehicle path optimization model with time window is established in this paper. The two-stage method and the improved genetic algorithm are proposed, and the validity of the model and algorithm is verified by an example. The main contents and achievements of this paper are as follows: 1. By describing the VRP problem, this paper analyzes the definition and classification of the dynamic vehicle routing problem (DVRP), and puts forward that the DVRP problem is caused by the uncertainty of customer demand time, and analyzes the connotation of modern lean logistics and the distribution system of cigarette logistics. Summed up the lean distribution strategy of cigarette logistics. 2. Aiming at the dynamic VRP problem with time window (DVRPTW), the penalty function of soft time window is set up, and the optimization model of lean distribution path of cigarette logistics is established, which takes the minimum cost of punishment and cost of distribution as the objective function. 3. By analyzing the working principle of DVRPTW in tobacco distribution center, a two-stage solution strategy of "static initial optimization stage dynamic local optimization stage" distribution path model is proposed. 4. In order to solve the problem of dynamic VRP with time window (DVRPTW) in cigarette logistics, an improved genetic algorithm is proposed to solve the problem of cigarette logistics, such as premature convergence and so on. The best individual preservation strategy combined with the selection of gambling wheel is adopted, and the simulated annealing method, which is suitable for the existing path transformation, is adopted. Taking 20 customers in a district of Yiyang Tobacco Company of Hunan Province as an example, the correctness of the model and the validity of the solution method are verified, and the decision basis for the actual dynamic vehicle routing is provided.
【學(xué)位授予單位】:北京交通大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2013
【分類號(hào)】:TS48;U492.22;F426.89
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 楊弋,顧幸生;物流配送車輛優(yōu)化調(diào)度的綜述[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2003年S1期
2 李軍;有時(shí)間窗的車輛路線安排問(wèn)題的啟發(fā)式算法[J];系統(tǒng)工程;1996年05期
3 郭耀煌,謝秉磊;一類隨機(jī)動(dòng)態(tài)車輛路徑問(wèn)題的策略分析[J];管理工程學(xué)報(bào);2003年04期
4 周紹朋;;企業(yè)管理與核心競(jìng)爭(zhēng)力[J];經(jīng)濟(jì)管理;2003年03期
5 李琳;劉士新;唐加福;;改進(jìn)的蟻群算法求解帶時(shí)間窗的車輛路徑問(wèn)題[J];控制與決策;2010年09期
6 王旭;葛顯龍;代應(yīng);;基于兩階段求解算法的動(dòng)態(tài)車輛調(diào)度問(wèn)題研究[J];控制與決策;2012年02期
7 蔣海巖,張卉;淺析煙草專賣體制[J];山東經(jīng)濟(jì);2005年01期
8 王成亮,顧寶炎;差異化客戶細(xì)分模型的建立和應(yīng)用[J];上海管理科學(xué);2005年01期
9 常浩;;城市配送最后一公里問(wèn)題的研究[J];商品與質(zhì)量;2012年S3期
10 金鷗,段寧東,劉卉,劉順鴻,李怡佳,佘怡,車科;WTO有關(guān)協(xié)議對(duì)中國(guó)煙草產(chǎn)業(yè)發(fā)展的影響及對(duì)策建議[J];思想戰(zhàn)線;2001年01期
相關(guān)博士學(xué)位論文 前1條
1 王君;不確定因素下車輛路徑問(wèn)題建模及優(yōu)化方法研究[D];天津大學(xué);2012年
,本文編號(hào):2072041
本文鏈接:http://sikaile.net/guanlilunwen/shengchanguanlilunwen/2072041.html