本文選題：自動(dòng)補(bǔ)貨 + M/G/1排隊(duì)模型　； 參考：《山東大學(xué)》2014年碩士論文

【摘要】：隨著產(chǎn)業(yè)結(jié)構(gòu)的調(diào)整,勞動(dòng)力成本的上漲,物流系統(tǒng)自動(dòng)化建設(shè)的步伐不斷加快。2012年國(guó)內(nèi)物流自動(dòng)化分揀設(shè)備市場(chǎng)增長(zhǎng)在20%以上。自動(dòng)分揀系統(tǒng)具有分揀速度快、準(zhǔn)確率高等特點(diǎn),在醫(yī)藥、煙草、食品、汽車(chē)等行業(yè)應(yīng)用尤為突出。 自動(dòng)補(bǔ)貨系統(tǒng)保證了自動(dòng)分揀系統(tǒng)的正常運(yùn)行,是系統(tǒng)高效分揀的前提。但是目前對(duì)于自動(dòng)補(bǔ)貨系統(tǒng)的設(shè)計(jì)和改進(jìn),往往只停留在根據(jù)設(shè)備的性能按照經(jīng)驗(yàn)參數(shù)進(jìn)行配置的階段。沒(méi)有結(jié)合實(shí)際的分揀情況和品項(xiàng)分配等進(jìn)行精確的定量分析,缺少準(zhǔn)確的理論依據(jù)和衡量指標(biāo)。因此,如何用定量的方法,衡量各個(gè)補(bǔ)貨指標(biāo),對(duì)自動(dòng)補(bǔ)貨系統(tǒng)的設(shè)計(jì)和改進(jìn)有十分重要的意義。 本文應(yīng)用排隊(duì)系統(tǒng)理論對(duì)自動(dòng)補(bǔ)貨系統(tǒng)進(jìn)行建模,得出了最大補(bǔ)貨效率、平均補(bǔ)貨周期、待執(zhí)行的任務(wù)數(shù)三個(gè)補(bǔ)貨指標(biāo)與分揀效率、補(bǔ)貨設(shè)備的速度、服務(wù)時(shí)間、品項(xiàng)分配等變量的數(shù)量關(guān)系,為系統(tǒng)的配置提供數(shù)值依據(jù)。同時(shí),對(duì)數(shù)量關(guān)系進(jìn)行分析,在成本不變的情況下,通過(guò)優(yōu)化品項(xiàng)分配提高補(bǔ)貨效率。本文對(duì)兩種常用的補(bǔ)貨模式分別進(jìn)行了建模和仿真驗(yàn)證,并對(duì)備貨系統(tǒng)在實(shí)際運(yùn)作過(guò)程中因分揀線(xiàn)發(fā)生故障而引起的阻塞問(wèn)題提供了解決方案。 往復(fù)式補(bǔ)貨模式的建模與優(yōu)化：首先將補(bǔ)貨命令到達(dá)的過(guò)程和補(bǔ)貨服務(wù)時(shí)間利用卡方分布進(jìn)行模型擬合,由于其分別近似服從Poisson分布和指數(shù)分布,因此將其抽象為M/G/1排隊(duì)系統(tǒng)；結(jié)合實(shí)際的補(bǔ)貨流程,根據(jù)分析出的兩種具有實(shí)際意義的補(bǔ)貨服務(wù)時(shí)間改進(jìn)了的三個(gè)補(bǔ)貨指標(biāo)。其次以平均補(bǔ)貨周期為目標(biāo),利用遺傳算法進(jìn)行品項(xiàng)分配優(yōu)化；最后通過(guò)實(shí)例仿真,驗(yàn)證了模型的適用性和優(yōu)化算法的有效性,優(yōu)化后的補(bǔ)貨效率提高了7.2%,并分析了最大補(bǔ)貨效率、分揀效率與各個(gè)補(bǔ)貨指標(biāo)的關(guān)系。 環(huán)形補(bǔ)貨模式的建模與仿真：首先將其抽象為M/D/c排隊(duì)系統(tǒng),根據(jù)兩種服務(wù)時(shí)間求出改進(jìn)的三個(gè)補(bǔ)貨指標(biāo)；其次對(duì)模型進(jìn)行實(shí)例仿真,結(jié)果表明該模型可以很好的計(jì)算出環(huán)形補(bǔ)貨的運(yùn)行參數(shù),為優(yōu)化自動(dòng)補(bǔ)貨系統(tǒng)提供了依據(jù)；最后對(duì)兩種補(bǔ)貨模式在占用空間、成本、效率、可擴(kuò)展性等方面進(jìn)行了對(duì)比和分析。 本文最后通過(guò)設(shè)置最優(yōu)的故障緩存長(zhǎng)度解決了因某條分揀線(xiàn)發(fā)生故障而引起的補(bǔ)貨阻塞問(wèn)題,保證了其他分揀線(xiàn)的正常分揀；通過(guò)二分查找算法實(shí)現(xiàn)了故障緩存長(zhǎng)度的求解；然后分析隨著補(bǔ)貨量、補(bǔ)貨效率的變化而呈現(xiàn)的規(guī)律,綜合考慮空間、設(shè)備成本、服務(wù)質(zhì)量等指標(biāo),確定最優(yōu)的故障緩存長(zhǎng)度。實(shí)例仿真顯示,比服務(wù)時(shí)間按照定長(zhǎng)節(jié)約5%。
[Abstract]:With the adjustment of industrial structure, the rise of labor cost and the pace of automation of logistics system, the market of automatic sorting equipment of domestic logistics is increasing more than 20% in.2012 years. The automatic sorting system has the characteristics of fast sorting speed and high accuracy, especially in the fields of medicine, tobacco, food and automobile.
The automatic replenishment system ensures the normal operation of the automatic sorting system and is the precondition for the efficient sorting of the system. However, the design and improvement of the automatic replenishment system at present is usually only in the stage of configuration according to the performance of the equipment according to the experience parameters. The accurate quantitative analysis is not combined with the actual sorting and item allocation. Therefore, it is of great significance for the design and improvement of the automatic replenishment system to measure the index of each replenishment by quantitative method.
This paper uses the queuing system theory to model the automatic replenishment system, and obtains the maximum replenishment efficiency, the average replenishment cycle, the number relation of the number of replenishment indexes and sorting efficiency, the speed of the replenishment equipment, the time of the replenishment equipment, the service time and the distribution of items, so as to provide the numerical basis for the configuration of the system. In the case of the constant cost, the restocking efficiency is improved by optimizing the item allocation. This paper carries out modeling and simulation verification on two kinds of common replenishment modes, and provides a solution to the blocking problem caused by the failure of the sorting line during the actual operation of the stock system.
The modeling and optimization of reciprocating replenishment mode: first, the process of replenishment orders and the time of replenishment service are fitted by the chi square distribution. Because of their approximate obeying the Poisson distribution and exponential distribution, they are abstracted as M/G/1 queuing system, and two kinds of analysis are combined with actual replenishment flow. The meaning of the replenishment service time improved three replenishment indexes. Secondly, using the average replenishment cycle as the goal, the genetic algorithm is used to optimize the item allocation. Finally, the applicability of the model and the effectiveness of the optimization algorithm are verified by the example simulation. The efficiency of the replenishment is raised by 7.2% after the optimization, and the maximum replenishment efficiency and sorting efficiency are analyzed. The relationship between the rate and the replenishment index.
The modeling and Simulation of ring replenishment model: firstly, it is abstracted as M/D/c queuing system, and the improved three replenishment indexes are obtained according to two service times. Secondly, the model is simulated by example. The results show that the model can calculate the operating parameters of ring replenishment well, and provide the basis for optimizing the automatic replenishment system. Finally, the model is provided. The two replenishment models are compared and analyzed in terms of occupancy space, cost, efficiency and scalability.
At the end of this paper, the problem of replenishment congestion caused by the failure of a certain sorting line is solved by setting the optimal fault caching length, and the normal sorting of other sorting lines is guaranteed. The solution of the length of the fault caching is realized by the two point search algorithm, and then the regularity with the amount of replenishment and the change of the replenishment efficiency is analyzed. Considering the space, equipment cost, service quality and other indicators, the optimal fault caching length is determined. The example simulation shows that the service time is saved by fixed length 5%..

【學(xué)位授予單位】：山東大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：O226;F259.23

【參考文獻(xiàn)】

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

1 蔣蕊聰;;自動(dòng)分揀系統(tǒng)[J];中國(guó)儲(chǔ)運(yùn);2007年11期

2 賈錦珠;;物流邁入自動(dòng)分揀和輸送系統(tǒng)時(shí)代[J];中國(guó)儲(chǔ)運(yùn);2008年06期

3 王之泰;配送中心形成與發(fā)展研究[J];物流技術(shù);2000年01期

4 魯五一;袁慶國(guó);戴建民;;卷煙分揀系統(tǒng)的時(shí)間建模分析[J];物流技術(shù);2007年11期

5 張貽弓;林茂;;卷煙分揀設(shè)備的選型與優(yōu)化[J];物流技術(shù)與應(yīng)用;2008年09期

6 ;FLUID-BASED SIMULATION APPROACH FOR HIGH VOLUME CONVEYOR TRANSPORTATION SYSTEMS[J];Journal of Systems Science and Systems Engineering;2004年03期

7 ;A MODEL AND AN ANALYTICAL METHOD FOR CONVEYOR SYSTEMS IN DISTRIBUTION CENTERS[J];Journal of Systems Science and Systems Engineering;2010年04期

8 王雄志;王國(guó)慶;;配送中心補(bǔ)貨作業(yè)問(wèn)題的啟發(fā)式算法[J];系統(tǒng)工程理論與實(shí)踐;2008年04期

9 肖際偉;吳耀華;婁山佐;孫國(guó)華;;復(fù)合式卷煙分揀系統(tǒng)分揀機(jī)組合優(yōu)化[J];系統(tǒng)工程理論與實(shí)踐;2010年02期

10 周文正;尹平;馬玉全;劉少礎(chǔ);周俊;馮聰;周愛(ài)平;林嵩藝;;排隊(duì)論模型M/D/c在醫(yī)療服務(wù)系統(tǒng)中的應(yīng)用[J];中國(guó)衛(wèi)生統(tǒng)計(jì);2009年06期

相關(guān)博士學(xué)位論文 前2條

1 劉鵬;通道式自動(dòng)分揀系統(tǒng)的配置優(yōu)化研究[D];山東大學(xué);2011年

2 肖際偉;配送中心揀貨系統(tǒng)優(yōu)化[D];山東大學(xué);2010年

，

本文編號(hào)：1817720