本文關(guān)鍵詞： 卷煙自動化立體倉庫 貨位分區(qū) 揀選路徑 遺傳算法　出處：《石家莊鐵道大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著市場經(jīng)濟(jì)的不斷發(fā)展和改革開放進(jìn)程的不斷加快，煙草行業(yè)在提高效率、降低物流成本、服務(wù)質(zhì)量上水平等方面面臨著很大的挑戰(zhàn)。面對日益復(fù)雜的內(nèi)外部市場環(huán)境，如何降低其運營成本是亟待解決的問題。卷煙物流配送中心的操作環(huán)節(jié)主要包括卷煙的采購、入庫、倉儲、分揀、出庫等環(huán)節(jié)，實現(xiàn)卷煙從工業(yè)企業(yè)到零售戶，最終到消費者的空間轉(zhuǎn)移。而這些環(huán)節(jié)大部分都是通過自動化立體倉庫來完成的，因而，其運行效率的高低直接關(guān)系到煙草物流配送的經(jīng)濟(jì)效益，而立體倉庫的貨位存放與揀選路徑正是影響立體倉庫效率的重要指標(biāo)，所以本論文也將這兩個問題作為研究的重點。 在對石家莊煙草物流企業(yè)實際情況的調(diào)研中發(fā)現(xiàn)，立體倉庫的貨位分配策略不盡合理，倉儲系統(tǒng)在入庫時僅僅是隨機(jī)的將托盤卷煙存放在空置的貨位存放架上，出庫時堆垛機(jī)隨機(jī)的根據(jù)系統(tǒng)命令隨機(jī)尋找目標(biāo)，然后將托盤取至出口平臺進(jìn)行分揀作業(yè)，這樣既缺乏先進(jìn)的科學(xué)依據(jù)，又不利于件煙的快速出、入庫，且貨品存放隨意，庫存面積利用率不高，庫存周轉(zhuǎn)效率較低，使得每件煙的物流成本增加了20%，嚴(yán)重影響了企業(yè)的生產(chǎn)組織和經(jīng)濟(jì)效益．同時對結(jié)構(gòu)功能復(fù)雜的存取設(shè)備的消耗折舊也有很大的影響，因此對立體倉庫出入庫的優(yōu)化問題進(jìn)行研究具有很大的現(xiàn)實意義。 針對上述存在的兩個問題，首先根據(jù)優(yōu)化目標(biāo)建立了貨位分配的優(yōu)化數(shù)學(xué)模型，其次將多目標(biāo)問題通過權(quán)重系數(shù)變化法轉(zhuǎn)化為單目標(biāo)問題，，然后運用遺傳算法求解，為了驗證算法的正確性，用MATLAB軟件對優(yōu)化結(jié)果進(jìn)行仿真分析，把優(yōu)化前后的數(shù)據(jù)用三維圖形表現(xiàn)出來，從仿真結(jié)果可以看出，優(yōu)化后的存取效率明顯提高，驗證了算法的實用性；將堆垛機(jī)揀選作業(yè)路徑優(yōu)化問題近似為旅行商問題來求解，求解旅行商問題屬于NP難題，最優(yōu)解的數(shù)量會隨著訪問城市數(shù)量成指數(shù)增長，因而堆垛機(jī)執(zhí)行揀選任務(wù)時的行走路徑也是如此。針對這一問題，建立最短路徑數(shù)學(xué)模型，用遺傳算法求出堆垛機(jī)揀選作業(yè)路徑的最優(yōu)解，仿真結(jié)果表明所提出的方法是有效的。
[Abstract]:With the continuous development of market economy and the process of reform and opening up, the tobacco industry is improving efficiency and reducing logistics costs. The level of service quality is facing great challenges. In the face of increasingly complex internal and external market environment. How to reduce its operating cost is an urgent problem. The operation of cigarette logistics distribution center mainly includes cigarette procurement, storage, warehousing, sorting, out of storage and other links, to achieve cigarettes from industrial enterprises to retail households. Finally, the space transfer to consumers. And most of these links are completed through automated three-dimensional warehouse, therefore, its operational efficiency is directly related to the economic benefits of tobacco logistics distribution. The storage and picking path of the warehouse is an important index to affect the efficiency of the warehouse, so this paper also focuses on these two issues. In the investigation of the actual situation of Shijiazhuang tobacco logistics enterprises, it is found that the allocation strategy of the three-dimensional warehouse is not reasonable. The storage system only stores the pallets of cigarettes at random on the empty storage rack, and the stacker randomly looks for the target according to the system order when leaving the warehouse. Then the pallet is taken to the export platform for sorting operation, which is not only lack of advanced scientific basis, but also not conducive to the rapid exit of cigarettes, storage, and goods stored at will, inventory area utilization rate is not high. The low efficiency of inventory turnover increased the logistics cost of each cigarette by 20%. It seriously affects the production organization and economic benefit of the enterprise, and also has a great influence on the depreciation of the consumption of the access equipment with complex structure and function. Therefore, it is of great practical significance to study the optimization of the storage in and out of the stereoscopic warehouse. In view of the above two problems, first of all, the optimal mathematical model of cargo space allocation is established according to the optimization objective, and secondly, the multi-objective problem is transformed into a single-objective problem by the weight coefficient change method. Then the genetic algorithm is used to solve the problem. In order to verify the correctness of the algorithm, the optimization results are simulated and analyzed by MATLAB software, and the data before and after optimization are represented by three-dimensional graphics. From the simulation results, we can see that the efficiency of the optimized access is improved obviously, and the practicability of the algorithm is verified. The route optimization problem of stacker picking job is approximately solved by traveling salesman problem. Solving the traveling salesman problem belongs to NP problem, and the number of optimal solution will increase exponentially with the number of visited cities. Therefore, the same is true of the walking path when the stacker performs the picking task. In view of this problem, a mathematical model of the shortest path is established, and the optimal solution of the picking operation path of the stacker is obtained by genetic algorithm. Simulation results show that the proposed method is effective.
【學(xué)位授予單位】：石家莊鐵道大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP18;F426.8;F252

【參考文獻(xiàn)】

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

1 馬婷;郭彥峰;;基于最小時間算法的貨位優(yōu)化研究[J];包裝工程;2008年02期

2 李海洋;;ABC分類法在藥品庫存管理中的應(yīng)用[J];當(dāng)代醫(yī)學(xué);2009年04期

3 林天翔;;自動化倉庫貨位優(yōu)化管理研究[J];現(xiàn)代商業(yè);2008年21期

4 林秀田;;提高企業(yè)倉儲管理水平的對策分析[J];現(xiàn)代商業(yè);2009年29期

本文編號：1462193