基于啟發(fā)式算法的物流配送路線優(yōu)化設(shè)計(jì)
[Abstract]:Efficient and reasonable distribution is the basic guarantee of the smooth operation of the logistics system. Whether the distribution route planning is reasonable or not has a great impact on the distribution speed, cost and benefit. The correct and reasonable arrangement of the vehicle distribution route and the realization of the reasonable route transportation can effectively save the transportation time, improve the utilization rate of the vehicle, reduce the transportation cost of the logistics, improve the economic benefit of the enterprise and the level of customer service. It is one of the effective ways for enterprises to improve their competitiveness. The optimization design problem of multi-vehicle logistics distribution route has high computational complexity and belongs to NP problem, but the approximate optimal solution can still be obtained by constructing heuristic algorithm and combining the exact algorithm with heuristic algorithm to establish mathematical model. Firstly, this paper briefly summarizes the related concepts and main knowledge points of logistics distribution and distribution route. Then taking the current distribution route scheme of a dairy company in Tianjin as an example, the route of logistics distribution is studied and analyzed, and the model is established and the saving algorithm and scanning algorithm are constructed in heuristic algorithm. The model is solved by the improved nearest insertion method and the accurate algorithm combined with the nearest insertion method, so as to achieve the optimal design of the logistics distribution route. Finally, the optimization results of the four algorithms are compared and analyzed to select the best scheme for the logistics distribution route of the company. Finally, it can shorten the distance of transportation route, reduce the cost of logistics distribution, improve the operating efficiency, customer satisfaction and the competitiveness of the industry.
【學(xué)位授予單位】:山東大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2014
【分類號(hào)】:F426.82;F252
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 李永安;陳陽;;物流運(yùn)輸與配送的整合分析[J];中國儲(chǔ)運(yùn);2006年01期
2 李嘉,王夢光,唐立新,宋建海;一類特殊車輛路徑問題(VRP)[J];東北大學(xué)學(xué)報(bào);2001年03期
3 張濤,王夢光;遺傳算法和3-opt結(jié)合求解帶有能力約束的VRP[J];東北大學(xué)學(xué)報(bào);1999年03期
4 紀(jì)壽文,繆立新,李克強(qiáng),連小珉;貨運(yùn)車輛優(yōu)化調(diào)度方法[J];公路交通科技;2003年06期
5 葉志堅(jiān),葉懷珍,周道平,易海燕;多車型車輛路徑問題的算法[J];公路交通科技;2005年05期
6 章兢,周泉;基于免疫克隆算法的物流配送車輛路徑優(yōu)化研究[J];湖南大學(xué)學(xué)報(bào)(自然科學(xué)版);2004年05期
7 孔少徹;梁彤錚;;商品物流配送優(yōu)化策略探討[J];市場論壇;2009年07期
8 肖鵬,李茂軍,張軍平,童調(diào)生;車輛路徑問題的單親遺傳算法[J];計(jì)算技術(shù)與自動(dòng)化;2000年01期
9 陳湘州,黎志明,劉祖潤;一種改進(jìn)的整數(shù)編碼遺傳算法在車輛路徑優(yōu)化問題中的應(yīng)用[J];南方冶金學(xué)院學(xué)報(bào);2004年01期
10 孫黎宏;許恒勤;;多包裝形式下貨物配裝問題的研究[J];森林工程;2006年05期
相關(guān)博士學(xué)位論文 前1條
1 陳萍;啟發(fā)式算法及其在車輛路徑問題中的應(yīng)用[D];北京交通大學(xué);2009年
,本文編號(hào):2140762
本文鏈接:http://sikaile.net/jingjilunwen/gongyejingjilunwen/2140762.html