本文關(guān)鍵詞：白酒企業(yè)銷售物流配送路徑優(yōu)化研究　出處：《吉林大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 白酒企業(yè) 配送 VRP C-W節(jié)約算法

【摘要】：21世紀(jì)，物流將成為一個(gè)重要的經(jīng)濟(jì)增長(zhǎng)點(diǎn)。隨著經(jīng)濟(jì)的發(fā)展，現(xiàn)代企業(yè)激烈的競(jìng)爭(zhēng)使得產(chǎn)品的成本和利潤(rùn)變得非常透明，企業(yè)的利潤(rùn)空間越來(lái)越小，我國(guó)白酒企業(yè)面臨的形勢(shì)更加嚴(yán)峻。白酒企業(yè)若想能夠快速的走出低迷，適應(yīng)市場(chǎng)環(huán)境的變化，以提升企業(yè)的市場(chǎng)競(jìng)爭(zhēng)力，必須加強(qiáng)銷售物流系統(tǒng)建設(shè)、合理提升配送能力、改善客戶服務(wù)水平。 本文為提高白酒企業(yè)銷售物流的配送服務(wù)能力，對(duì)車輛的運(yùn)輸路徑問(wèn)題（Vehicle Routing Problems，VRP）進(jìn)行了優(yōu)化研究。銷售物流配送過(guò)程中，運(yùn)力的浪費(fèi)、配送路線的錯(cuò)誤選擇、貨物的配送差錯(cuò)和損壞等問(wèn)題不僅影響配送效率，造成配送成本增加，而且嚴(yán)重影響企業(yè)的客戶服務(wù)水平。為了解決這些問(wèn)題，本文在闡述了物流配送規(guī)劃相關(guān)理論的基礎(chǔ)上，介紹了配送車輛路徑優(yōu)化問(wèn)題的相關(guān)算法，，通過(guò)分析各種算法的適用性，對(duì)比選擇了C-W節(jié)約算法，針對(duì)客戶對(duì)配送貨物送達(dá)時(shí)間要求更加嚴(yán)格的情況，并C-W節(jié)約算法進(jìn)行了改進(jìn)，加入了時(shí)間窗約束和懲罰系數(shù)，使其能夠解決有時(shí)間窗的車輛路徑問(wèn)題（Vehicle Routing Problems with Time Windows，VRPTW）。最后，以內(nèi)蒙古順鑫寧城老窖酒業(yè)有限公司為例進(jìn)行了實(shí)例研究，通過(guò)調(diào)研了解其銷售物流配送系統(tǒng)的實(shí)際問(wèn)題，獲得了相關(guān)的數(shù)據(jù)資料，采用改進(jìn)的有時(shí)間窗約束的C-W節(jié)約算法對(duì)公司的銷售物流配送車輛路徑進(jìn)行了優(yōu)化，對(duì)運(yùn)輸車輛進(jìn)行了合理分配，調(diào)整了配送周期，結(jié)果顯示優(yōu)化后的配送線路進(jìn)行了合理劃分，與優(yōu)化前相比車輛的滿載率、實(shí)載率明顯提高和運(yùn)輸總里程縮短，貨物的送達(dá)時(shí)間能夠滿足各個(gè)零售商的要求，最終獲得了滿意的銷售物流配送方案，從而驗(yàn)證了改進(jìn)的節(jié)約算法的實(shí)用性和可行性。
[Abstract]:In twenty-first Century, the logistics will become an important economic growth point. With the development of economy, the modern enterprise competition makes the cost and profit of products become very transparent, enterprise profit space more and more small, facing China's liquor business more serious situation. If the liquor companies can quickly adapt to the changing market environment out of recession., to enhance the market competitiveness of enterprises, we must strengthen the construction of sales logistics system, rational distribution capabilities to enhance and improve the customer service level.
In order to improve the liquor business sales logistics capability of distribution services, transportation of the vehicle routing problem (Vehicle Routing, Problems, VRP) was studied. In the distribution process, capacity of waste, the wrong selection of distribution route, distribution error and damage of goods not only affects the efficiency of distribution, resulting in the increase of delivery costs, and seriously affect the level of customer service. In order to solve these problems, this article elaborates the logistics planning theory, introduces the related algorithm for distribution vehicle routing optimization problem, through the analysis of the applicability of various algorithms, comparison chose C-W saving algorithm, for the customer to deliver goods delivery time of more stringent requirements the situation, and C-W algorithm is improved, adding time window constraints and penalty coefficient, which can solve the vehicle routing with time windows. Title (Vehicle Routing Problems with Time Windows, VRPTW). Finally, taking Inner Mongolia Shunxin wine limited company ningchenglaojiao carries out a case study of practical problems, the distribution system is understood through research, access to the relevant data, the improved time window constraint C-W algorithm for path distribution the vehicle company is optimized for transport vehicles for a reasonable allocation, adjust the distribution cycle, results show that the optimization of distribution line after a reasonable division, compared with before the optimization of vehicle loading rate, loading rate increased and the total mileage of transport of goods is shortened, the delivery time can meet the various requirements of retailers, eventually the sales logistics scheme is satisfactory, which verifies the feasibility and practicability of modified saving algorithm.

【學(xué)位授予單位】：吉林大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：F259.23;F426.82

【參考文獻(xiàn)】

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

1 崔宏志;龔加安;;帶時(shí)間窗車輛路徑問(wèn)題的改進(jìn)節(jié)約算法[J];純粹數(shù)學(xué)與應(yīng)用數(shù)學(xué);2011年05期

2 韋欽平;邵維;劉飛燕;;基于動(dòng)態(tài)規(guī)劃迭代法的最小H圈路徑優(yōu)化研究[J];長(zhǎng)沙大學(xué)學(xué)報(bào);2012年02期

3 馮華;;基于MapX和Floyd算法的最短路徑搜索系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)[J];電腦編程技巧與維護(hù);2011年24期

4 周延波;光昕;;我國(guó)連鎖零售業(yè)物流配送的現(xiàn)狀與對(duì)策分析——從沃爾瑪物流配送中心的成功經(jīng)驗(yàn)說(shuō)起[J];對(duì)外經(jīng)貿(mào)實(shí)務(wù);2011年09期

5 張學(xué)志;陳功玉;;車輛路線安排的改進(jìn)節(jié)約算法[J];系統(tǒng)工程;2008年11期

6 g靶

本文編號(hào)：1370904